System and method for anonymous location verification

ABSTRACT

A computer implemented system for anonymous electronic verification of location credentials including at least one processor and data storage is described in various embodiments. The system includes cryptographic mechanisms and electronic communication between one or more computing systems that in concert, provide verification of a prover&#39;s location credentials in accordance to logical conditions of a verifier&#39;s policy without providing additional information to a verifier entity.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation-in part of, and claims all benefit including priority to, U.S. application Ser. No. 16/503,154 dated 3 Jul. 2019 which is a non-provisional of, and claims all benefit including priority to, U.S. Application No. 62/693,680 dated 3 Jul. 2018, U.S. Application No. 62/702,684 dated 24 Jul. 2018, and U.S. Application No. 62/839,408 dated 26 Apr. 2019, all entitled SYSTEM AND METHOD FOR AN ELECTRONIC IDENTITY BROKERAGE, all incorporated herein in their entirety by reference.

This application is a non-provisional of, and claims all benefit including priority to, U.S. Application No. 62/795,979, dated 23 Jan. 2019, U.S. Application No. 62/801,322, dated 5 Feb. 2019, and U.S. Application No. 62/839,407, dated 26 Apr. 2019, all entitled SYSTEM AND METHOD FOR ANONYMOUS LOCATION VERIFICATION; and to U.S. Application No. 62/839,408, dated 26 Apr. 2019, entitled SYSTEM AND METHOD FOR AN ELECTRONIC IDENTITY BROKERAGE, all incorporated herein in their entirety by reference.

FIELD

Embodiments of the present disclosure generally relate to the field of electronic verification, and more specifically, embodiments relate to devices, systems and methods for electronic verification of anonymous location credentials.

INTRODUCTION

The verification of characteristics of an entity is a useful tool in the context of decision making, for example, in relation to access provisioning, goods and service provisioning, among others. The anonymous verification of an entity may also be useful and desirable.

However, an individual when providing credentials for verification may wish to restrict the amount of information being provided to the counterparty, particularly in regards to the location of the individual. The credentials being provided, to increase trust, may also benefit from verification through association with a third-party verifier (e.g., indicating that the individual is who they purport to be, and located where they purport to be).

Credential assertion with restricted information has been difficult to implement in practice as it is technically challenging to generate and provide sufficient trusted credentials, especially on a high-volume, scalable system adapted to serve a large number of users on an on-demand basis.

SUMMARY

Embodiments described herein are directed to computer systems and devices directed to provide a cryptographic platform for generating and transmitting messages that are adapted to assert attributes about various objects (e.g., user profiles, including user locations) without indicating any more than is actually required (e.g., anonymously), and corresponding methods and computer readable media storing machine-interpretable instruction sets for performing the methods.

The computer systems and devices, in accordance with some embodiments, are adapted to a high-volume, scalable system, which dynamically responds to data credential requests of one or more users or one or more computer systems requesting identity/credential proofs (including anonymous location of users).

In some embodiments, the assertions are conducted using mobile endpoints (e.g., user devices) which may have limited computational performance and resources, and accordingly, an improved cryptographic approach and system is proposed that enables the assertion functionality through the passing of cryptographically generated messages between devices. An improvement associated with the proposed cryptographic approach of some embodiments is that it is able to operate in a secure and scalable way, even on limited computational resources (e.g., those available on an unenhanced smartphone).

In some embodiments, there is provided a system for anonymous location verification. The system comprises at least one processor and a memory comprising instructions which when executed by the processor cause the processor to determine if an address is within at least one of a radius of a location, a polygon shape defining an area, or a union of convex polygon shapes.

In some embodiments, there is provided a computer implemented system for communicating data messages between a verifier computing device and a portable client computing device. The data messages establish authentication of at least one client location characteristic of the portable client computing device. The system comprises the portable client computing device including at least a client computing device processor and data storage. The data storage stores one or more token data objects received from or computed jointly in a multiparty protocol with an issuer computing device. The one or more token data objects generate, using at least an issuer computing device private issuance key, the one or more token data objects where each include one or more signed data elements representing at least one of the at least one client location characteristic of the portable client computing device. The client computing device processor is configured to receive a verification request data message from the verifier computing device, and using a combination of the one or more token data objects and the verification request data message generate one or more proof data messages without sending any data messages or requests to the issuer computing device. The verification request data message comprises a request for confirmation that the portable client device is associated with a particular geographic location.

In some embodiments, there is provided a computer implemented method for communicating data messages between a verifier computing device and a portable client computing device. The data messages establish authentication of at least one client location characteristic of the portable client computing device. The method comprises storing one or more token data objects received from an issuer computing device, receiving a verification request data message from the verifier computing device, and generate one or more proof data messages using a combination of the one or more token data objects and the verification request data message, without sending any data messages or requests to the issuer computing device. The one or more token data objects are generated using at least an issuer computing device private issuance key. The one or more token data objects each include one or more signed data elements representing at least one of the at least one client location characteristic of the portable client computing device. The verification request data message comprises a request for confirmation that the portable client device is associated with a particular geographic location.

Corresponding computer implemented methods and computer readable media are contemplated.

DESCRIPTION OF THE FIGURES

In the figures, embodiments are illustrated by way of example. It is to be expressly understood that the description and figures are only for the purpose of illustration and as an aid to understanding.

Embodiments will now be described, by way of example only, with reference to the attached figures, wherein in the figures:

FIG. 1 is a pictorial rendering of an example scenario, according to some embodiments.

FIG. 2 is a graphical representation of parties to a verification event, according to some embodiments.

FIG. 3 is an example system for conducting credential verification, according to some embodiments. The system aspects may include logical components, physical components, or a combination of logical and physical components, in accordance with various embodiments.

FIG. 4 is an example O-Auth based method, according to some embodiments.

FIG. 5A is an example method diagram where a secure enclave master verifier is utilized, according to some embodiments.

FIG. 5B is a state diagram of a verify oracle, according to some embodiments.

FIG. 6A is a system diagram providing additional detail in the context of a verifier hosted enclave, according to some embodiments.

FIG. 6B is a system diagram providing a simplified variation of the system shown in FIG. 6A, according to some embodiments.

FIG. 7 is a method diagram providing an example issuer sequence where the prover computing system has a corresponding key pair, according to some embodiments. As described in later figures, the prover key is optional, but in some cases, the prover key pair helps prevent sharing or can be utilized to reduce an amount of data required to be held secret. The use of a key pair for the prover may be instrumental in preventing credential subletting, an abuse of the system whereby the prover shares some of their credentials with another for attribute impersonation.

FIG. 8 is a method diagram providing an example verification sequence, where the prover computing system has a corresponding key pair, according to some embodiments.

FIG. 9 is a method diagram providing an example issuer sequence where the prover computing system does not have a corresponding key pair, according to some embodiments.

FIG. 10 is a method diagram providing an example verification sequence, where the prover computing system does not have a corresponding key pair, according to some embodiments.

FIG. 11 is a system diagram providing an example verification system having a third party hosted enclave including a transcript, according to some embodiments.

FIG. 12 is an example C-based proof request description language, according to some embodiments.

FIG. 13 is an example method diagram for an anonymous credentials approach, according to some embodiments.

FIG. 14 illustrates, in a component diagram, an example of a module breakdown of an identity brokerage, in accordance with some embodiments.

FIG. 15A illustrates, in a flowchart, an example of a method of determining that a geographic point is within a geographic area, in accordance with some embodiments.

FIG. 15B illustrates, in a flowchart, an example of a method of proving that a first geographic point is within a radius of another geographic point, in accordance with some embodiments.

FIG. 15C illustrates, in a flowchart, an example of a method of proving that a first geographic point is within a polygon shape having vertices defining an area, in accordance with some embodiments.

FIG. 15D illustrates, in a flowchart, an example of a method of determining that a location point is within a union of convex polygon shapes defining an area, in accordance with some embodiments.

FIG. 15E illustrates, in a flowchart, a method of simulating a proof that a particular geographic location is within an area defined by an origin and a radius, in accordance with some embodiments.

FIG. 15F illustrates, in a flowchart, a method of simulating a proof that a particular geographic location is within an area defined by a polygon shape having vertices, in accordance with some embodiments.

FIG. 16 is a screenshot of an example credential manager, according to some embodiments. Depending on the computational power of the mobile device, an application residing on a mobile device, such as the credential manager, is configured to perform one or more actions directed to the prover role in the above embodiments.

FIG. 17 is a screenshot of an example credential manager having an expanded portion to view additional details of the credential, according to some embodiments.

FIG. 18 is a screenshot of an example credential manager showing an expanded credential view of a single credential, according to some embodiments.

FIG. 19 is a screenshot of an example page requiring verification, according to some embodiments.

FIG. 20 is a screenshot of an example proof request interface page, according to some embodiments.

FIG. 21 is a screenshot of an example proof input interface page, according to some embodiments.

FIG. 22 is a topology of an example computing device, according to some embodiments.

FIG. 23 is a server for inclusion in a data center, according to some embodiments.

FIG. 24 is a system diagram for an example verification system, according to some embodiments.

FIG. 25 is a system diagram depicting a method for registration, according to some embodiments.

FIG. 26 is a system diagram depicting a method for verification, according to some embodiments.

FIG. 27 is a system diagram depicting an example age verifier device, according to some embodiments.

DETAILED DESCRIPTION

Embodiments described herein are directed to computer systems and devices directed to provide a cryptographic platform for generating and transmitting messages that are adapted to assert attributes about various objects (e.g., user profiles, including user addresses) without indicating any more than is actually required (e.g., anonymously), and corresponding methods and computer readable media storing machine-interpretable instruction sets for performing the methods.

Credential verification, when conducted manually, is a tedious process prone to falsification and also over-provisioning of information. In an example, Alice is a law-abiding 26 year old, and she would like to attend a community event that is free to members of the public who live in a certain area. Before allowing access to the community event to Alice, Bob wants to make sure that Alice lives in the prescribed area.

Alice thinks the conditions are fair, and they both know presenting her ID card would prove that she does satisfy them. She could provide her driver's license, which shows her name, address and date of birth. She would like to not disclose anything to him other than the fact that she satisfies the conditions. However, by providing her driver's license, Bob ends up knowing more than he needs to know (e.g., age, address and specific date of birth as opposed to the fact that she lives in the community). Further, aside from visual inspect of the license, Bob has practical difficulties in verifying that the driver's license is not a fake driver's license.

Accordingly, a challenge involves providing a robust credential verification whereby Alice is able to prove to Bob that she does live in the community, while revealing nothing other than the fact to him. As an example, consider a policy of living within a radius of a location, such as a community centre. That is all Bob needs to know. He does not and should not know that Alice is in fact 26, nor her exact address.

The system is configured to adduce stripped down credentials to meet Bob's customer policy without exposing additional information. In particular, cryptographic techniques are utilized that undertake specific steps and computational approaches to provide a secure, yet computationally efficient mechanism for proof generation.

Accordingly, an issuer device issues one or more signed token data objects, which are stored on a client's device for later usage. Upon encountering a situation where verification is required, the client's device is configured to dynamically generate proof data messages which are then provided to the verifier's computing device (e.g., the verifier's smart phone, a point of sale device, an access control system, a mantrap gate). The verifier is able to conduct a verification check using the proof data message to see only that the conditions required in the original verification check message without providing the actual underlying characteristics. As the proof data messages are generated using the token data objects, the verifier is able to validate that such proof data message is associated with a trusted verifier.

There are two different types of proofs that are proposed in some embodiments, these being exact match proofs (non-zeroness protocol; e.g., this person either matches someone on a whitelist or doesn't match anyone on a blacklist), and conditional proofs (e.g., based on an inequality condition being matched, such as “over 18 years old?” or “live within a geographic area?”).

As described in various embodiments herein, improved cryptographic protocols are proposed that, relative to prior approaches, reduce an overall cryptographic complexity without a significant reduction in security. Accordingly, the proofs can be generated more quickly, which improves convenience, especially where a system is being established for mass adoption and client device characteristics are highly variable across the users (e.g., some users may be using devices with extremely limited capabilities).

An enhanced solution is described herein that is adapted for protecting a client's personal information and only providing what is needed by leveraging a client's special space using a secure enclave and a blockchain solution, in accordance with some embodiments.

A blockchain infrastructure and the secure enclave each store data sets representing aspects of signed attributes and, in some embodiments, a proof response logic. The block chain infrastructure can include distributed logic technologies and combination with cascading encryption to provide an immutable ledger. In some embodiments, the proof requests and responses can be conducted using intelligent connected devices such as a mobile device, or wearable devices (e.g., a smartwatch that is connected to a mobile device across Bluetooth low energy).

In an example embodiment, there are multiple authoritative issuers who are able to provide signed attributes (e.g., for storage in secure enclaves or on a distributed ledger blockchain data structure). Secure enclaves can be utilized, or other types of hardware protected spaces are usable.

A registration mechanism and method is utilized to initialize and populate the attributes using public and secret (private) encryption keys. Issuer devices create attribute data records that are generated using a combination of a client's public key and an issuer's secret key (e.g., using digital signatures or encryption/decryption). The attributes can be made publicly available, for example, on a blockchain, whereby the attributes can be signed by an issuer's secret key but encrypted using the client's public key.

A verification mechanism and method is provided whereby a communications channel can be established with an authenticated verifier device, which initiates a proof request, which triggers a process to establish a proof response that is transmitted to the verifier.

An example use case includes a specially configured residency verifier terminal, which for example, can include a graphical user interface rendering visual and coded objects such as a quick response code that can be scanned by a mobile device. Upon scanning the quick response code, the verification mechanism is invoked, and the mobile device may share data sets on a backend communications network such as the Internet. The proof response can be transferred to the verifier device based off of identifiers or information stored other on the residency verifier terminal, or encoded within the quick response code the residency verifier terminal returning true or false such that both a verifier such as a cashier, and the customer are able to visually confirm. The proof response rendering, for example, may be restricted to a true/false determination (e.g., additional private information is not disclosed or rendered).

There are computing devices that interoperate with one another in concert with the cryptographic platform, including devices associated with issuers, verifiers, and clients. The issuers are trusted entities which provide cryptographically validated credential messages that are issued to the client devices for storage thereon.

The cryptographically validated credential messages are then presentable to a verifier (e.g., a third party organization) that seeks to validate that identity or aspects of the identity (e.g., location such as address or residency, etc.) of the user associated with the client device. The cryptographically validated credential messages are configured such that the user is able to validate such identity or aspects without providing additional information associated with the user that is not requested (e.g., as opposed to presenting all the information on a driver's license).

The credential assertion platform is a high-volume, scalable system which dynamically responds to data credential requests of one or more users or one or more computer systems requesting identity/credential proofs.

In some embodiments, the assertions are conducted using mobile endpoints (e.g., user devices) which may have limited computational performance and resources, and accordingly, an improved cryptographic approach and system is proposed that enables the assertion functionality through the passing of cryptographically generated messages between devices.

An improvement associated with the proposed cryptographic approach of some embodiments is that it is able to operate in a secure and scalable way, even on limited computational resources (e.g., those available on an unenhanced smartphone).

For example, a device with limited computational resources can include basic smartphones, which may be one or more generations out of date, and also have limited amounts of on-board memory (e.g., 1-4 GB of memory) and storage (e.g., 8-64 GB of solid state memory). The transfer protocols as between the client devices and the verifier devices may also have limited bandwidth (e.g., through near-field communications (NFC), Bluetooth, limiting communications to only several Mbit/s).

Prior approaches required large numbers of large messages being sent, which made the approaches impractical where resources were limited. The approach proposed herein requires less messages and streamlines the amount of cryptographic computations required to make these assertions.

As described herein, an improved cryptographic mechanism and protocol is proposed that reduces an overall number of data messages and/or cryptographic steps required to be taken to generate the proof data messages. For example, the method of Belenkiy requires 4 randomizations, 3 group multiplications and 7 group exponentiations, which includes elliptic curve exponentiations that are computationally expensive (e.g., involves more than 256 operations on 512 long integers). In a proposed non-zeroness approach of some embodiments, a field inversion is provided, which itself is an expensive operation, but reduces a consideration number of group exponentiations.

The proof data messages are designed to have a “soundness” attribute whereby a malicious verifier is unable to find out from the proof data message more information that what is being provided in the proof data message (e.g., cannot find out the underlying characteristic values).

A computer implemented identity brokerage solution is described in accordance with various embodiments. The identity brokerage solution is adapted to address problems with identity and attribute verification, using computer implemented cryptographic approaches to provide a robust mechanism for conducting verifications while reducing the provisioning of extraneous information (e.g., information not required for the verification).

FIG. 1 is a pictorial rendering of an example scenario, according to some embodiments. Alice is a law-abiding 26 year old, and she is thirsting for beer. She decides to go to Bob's German-style beer hall to quench her thirst for beer. Bob is also currently offering a special discount for local resident within a geographic area close to Bob's establishment.

Bob is not looking for a headache so before selling beer to Alice, wants to make sure of two things: She is legally allowed to drink, meaning 21 years of age or more, and that she is not Mallory McFelon, a problem customer. Bob will also want proof that Alice lives within the geographic area if she is to receive the special discount offer. Alice thinks the conditions are fair, and they both know presenting her ID card would prove that she does satisfy them. She could provide her driver's license, which shows her name, address and date of birth.

Alice also knows that Bob tends to be nosy, so she would like to not disclose anything to him other than the fact that she satisfies the conditions. However, by providing her driver's license, Bob ends up knowing more than he needs to know (e.g., age, specific address and specific date of birth as opposed to the fact that she is above 21 years of age, is a resident of the geographic area, and is not Mallory). Further, aside from visual inspect of the license, Bob has practical difficulties in verifying that the driver's license is not a fake driver's license.

Accordingly, a challenge involves providing a robust credential verification whereby Alice is able to prove to Bob that she does satisfy Bob's customer policy, while revealing nothing other than the fact to him. As an example, consider a policy of “being older than 21” or “being a resident in a community or geographic area”. That is all Bob needs to know. He does not and should not know that Alice is in fact 26, or her exact address.

It should be understood that there are other uses for anonymous location verification. For example, when at a voting booth, a voter must prove their residency. The teachings herein allow voters to prove they live within a geographic area without needing to reveal their exact address.

FIG. 2 is a graphical representation of parties to a verification event, according to some embodiments. The parties to a verification event include a prover (e.g., the entity seeking to prove the entity's characteristics and/or identity, for example, through programmatic mobile application client 202 having a token 204 stored thereon), a verifier 206 (e.g., the entity seeking to verify the prover's characteristics and/or identity in accordance with a policy), and an issuer 208 (e.g., the entity, such as a financial institution, which has a relationship with the prover and can attest to the prover's characteristics and/or identity, whose representations are trusted by the verifier 206).

In accordance with various embodiments, the prover should be able to hide as many attributes as the prover seeks to prove that follows from their attributes having zero knowledge of the underlying attributes: “I've lived in the same city over the last 5 years”, or “I live at an address within a geographic area.”

The prover's client 202 holds credentials that are digitally signed by the issuer (“tokens”) 208. An example token are those provided by U-Prove specifications. A U-Prove token can include a credential similar to a PKI certificate with cryptographic wrapping of attributes to aid in reducing unwanted tracking of users.

For example, a token may have various artifacts wrapped therein and may include information, such as issuer parameters, including issuer public key information (e.g., coupled an issuer's private key) that can be used for signing or encrypting elements of information stored thereon to prove the veracity of such signature or to protect sensitive information. The issuer signature can be used by the prover or verifier to verify issuer parameters being relied upon, and the token itself, in some embodiments, may have one or more data fields storing information such as token usage restrictions, validity period, token metadata.

In some embodiments, the token is jointly created using a combination of issuer information and prover information. For example, there may be information stored thereon that is established in conjunction and hidden from the issuer, such as contact information, encryption key, or verifier supplied nonces, etc.

During issuance of a token, an issuer may authenticate the existence and access/control that the prover has over the prover's device.

Tokens include attributes that can be converted from a natural form to a sequence of large numbers (field elements) suitable for public key operations. These public key operations include anonymous credentials protocols.

Attributes are organized in a tree. An attribute can either come with a value, in which case it is called a leaf attribute, or bundle a number of sub-attribute, in which case it is called a parent attribute.

For example, consider a geographic location attribute. That would be most naturally divided up into a latitude sub-attribute and a longitude sub-attribute. Thus, a credential token can be considered consisting of a single root attribute containing all others as descendants.

Regardless of whether an attribute is disclosed, committed to, or hidden, the prover may wish to communicate metadata about it to the verifier. The most important such property is an attribute's name. The number “170” in an attribute would mean nothing without the name “height” attached. Additionally, such numeric attributes require units as context. The number “170” is absurd if considered in inches but plausible when in centimeters.

It is important to disclose this metadata even when attributes are being committed to. Consider the non-trivial example of heights and units. Consider an attraction park that refuses to admit people taller than 180 cm on a rollercoaster. Without the proper context provided, a 188 cm tall person can abuse an attribute a height attribute of 74 inches and successfully prove 74<180, thereby put him and others in danger.

In some embodiments, the token can include fields that additionally give the users an ability to decide if they want to hide an attribute's metadata. For example, even if hidden, an attribute attesting to a negative syphilis test can carry social stigma.

An attribute will be serialized into one “raw attribute” (a number or string) if the user chooses its metadata to depend on its parent's. If not, it will be serialized into two, the first representing its metadata and the second representing the value.

Every attribute's metadata contain an array called “subAttributes”. If the array is empty, the attribute is considered to be a leaf attribute. Each sub attribute has a corresponding entry in the array. If the sub attribute is encoded independently, the entry will be an integer, denoting how many raw attributes the sub attribute and all of its descendants (subtree) together will take. If it is encoded dependently, the subAttributes entry will be all of its metadata.

In this example, it is describing a token for an individual residing in 35.796682 N, 51.416549 E, and 188 cm tall. In radians, the coordinates are 0.624769962188 N and 0.897388070061 E.

The token from the slide will serialize into the following, each bullet point representing one raw attribute:

{subAttributes: [ {name: ”homeAddress”, type: “polarCoordinates”, subAttributes: [ {name: “longitude”, type: “polarCoordinate”, unit: “mRad”, subAttributes: [ ]}, 2 ]}, {name: “height”, type: “length”, unit: “cm”, subAttributes: [ ]} ]} 897 {name: “latitude”, type: “polarCoordinate”, unit: “μRad”, subAttributes: [ ]} 624770 188

A proof request is issued from the verifier 206 to the prover's client 202, asking the prover to give the verifier 206 cryptographic assurance that according to some issuer trusted by the verifier, the prover's attributes satisfy a certain (arbitrary) policy (e.g., older than 21, as far as provisioning alcohol is concerned), and these proof requests typically contain one or more challenge messages. A proof request can include a nonce, types of conditions, etc., and these conditions may be encapsulated as inequalities (e.g., intUserAge >18), or logical statements (e.g., intUserID not equal to 22412). One or more lookup reference data structures may also be passed, which can include blacklists, whitelists, values for various constants (e.g., MINIMUMDRINKINGAGE).

A proof is provided by the prover through client 202 as a response to the verifier 206's request, which includes cryptographic assurance that the prover's credentials satisfy the verifier 106's proof request, the cryptographic assurance being held being as good as the issuer 108's word. The proof is a data message that encapsulates various information (e.g., proof responses directed to a sigma protocol). The data message includes sufficient information such that the verifier is able to receive the data message, and conduct steps to validate and verify that such proof responses are indeed acceptable. In processing proof responses, the proof data message can include aspects indicative of the identity of an issuer, and a potential step is the validation by the verifier that such issuer is indeed trustworthy as a source of credential authentication.

The proof responses can be processed to generate gatekeeping control signals, which, for example, in an example embodiment, may be as simple as a device that operates a lightbulb whenever someone is validated as being of age (e.g., so that a bouncer at a bar is able to know that this person should be allowed in), or as complex as control mechanisms that automatically open doors, enable access to online accounts (e.g., on a web portal), etc. Accordingly, the verifier systems can include physical and electronic mechanisms which can generate alerts, notifications, actuation/control signals, digital or electronic signals, among others.

Factors for assessing identity brokerage solutions include how light the required infrastructure is (e.g., it may be important to reduce the need for specialized hardware, centralized devices, or complex distributed systems that make deployment and entry difficult), a level of computational efficiency, a simplicity of cryptography, a level of un-linkability between various parties (e.g., the issuer should not be able to aggregate additional data about the client, even in collusion with verifiers), and a flexibility and level of minimalism of disclosed information.

Any solution requiring the issuer to be online at verification time risks exposing additional information about the client to the issuer. This is especially concerning in cases where the issuer and the verifier collude to track client activities.

Reduced complexity is desirable as a solution may be less likely to suffer implementation flaws, be more easily understood, and less likely to theoretically break due to reliance on unusual hardness assumptions. If computational operations that have optimized/low-level implementations, the solution may be able to operate using less computing resources and/or time.

The identity protocols, ideally, should require little time, take little power, have few rounds of message transmission, and pass messages having small sizes and/or overhead. This is especially important where the parties implement portions of the identity brokerage solution on mobile devices to handle one or more verification events. The mobile devices have limited computational, storage, and interface capabilities.

The parties hold corresponding public/secret (e.g., private) key pairs. The public keys can be utilized to determine the veracity of information signed using the private keys, and to encrypt information that can be decrypted using the corresponding private key.

The private keys can be utilized to sign information and to decrypt information that has been encrypted using the corresponding public key, and in some cases, produce Zero-Knowledge Proofs of Knowledge. Each secret key is maintained by the corresponding computing device associated with the corresponding entity.

The parties each have corresponding computing systems, which are used to electronically communicate amongst one another (e.g., through a network) and to perform various cryptographic activities, including signing, verifying signatures, encrypting information, decrypting information and various anonymous credential issuance, proof and verification protocol implementations. Each verification event is associated with validating whether all logical conditions of the proof request are satisfied. A positive determination may lead to access/service/goods being provisioned to the prover. A negative determination may lead to access/service/goods not being provisioned to the prover.

A specific technological implementation of providing identity assertions with minimal disclosure is described in various embodiments. Three separate approaches are described, along with variations thereof. These approaches include (1) an O-Auth token based design, (2) a secure enclave based design, and (3) an anonymous credentials based design.

In some embodiments, a proposed approach is provided in an anonymous credentials based design whereby a client receives token data structure(s) that are stored on data storage, and asynchronously, the client gets a verifier request from a verifier. The verifier may, for example, have a list of trusted issuers that the issuer verifier trusts. Certain organizations may be trusted for certain information, such as a bank for employment or financial status, a university for educational attainment characteristics, among others. The client generates a proof (e.g., encapsulated as a proof data message) based on the token and the verifier request, and the proof can be established as either a non-zeroness proof or a conditional proof. Token objects can be received from or computed jointly in a multiparty protocol with an issuer computing device.

For a non-zeroness proof, the proof approach generation can include a first modular inverse, two randomization steps, two group exponentiations, and a group multiplication. In particular, the steps in an example non-limiting embodiment can be established as:

-   -   (1) Receive a verification request data message from the         verifier computing device, the verification request data message         including at least a nonce c₀.     -   (2) Compute t=x⁻¹ mod p, where x is the attribute value from the         token, and p is the order (e.g., size, number of elements) of         the discrete log group (e.g., elliptic curve, Diffie-Hellman         group) according to the cryptographic standards the parties         choose to use (e.g., elliptic curve, Diffie-Hellman group); t is         the modular inverse of x mod p.     -   (3) Sample a first random number r₁ and a second random         number,r₂, such that r₁, r₂∈         .     -   (4) Compute R=C_(x) ^(r) ¹ h^(r) ² , where R is effectively a         commitment to random values r₁ and r₂,C_(x) is a commitment to         attribute x,h is a group generator taken from cryptographic         specifications (e.g., elliptic curve, Diffie-Hellman group). A         commitment is a representation of a value that is both hiding         and binding, hiding in the sense that the recipient of the         commitment cannot find out anything about what the value of the         commitment is, and binding in the sense that the sender later         cannot pretend that it was a commitment to another value than it         originally was.     -   (5) Compute c=H(C_(x), R, c₀), where c is the proof challenge,         following the Fiat-Shamir Heuristic.     -   (6) Compute z₁=ct+r₁ and z₂=−cty+r₂, where z₁ and z₂ are proof         responses in a sigma protocol.     -   (7) Encapsulate and transmit one or more proof data messages         including R, z₁ and z₂ as data objects to the verifier computing         device, such that the verifier computing device is able to         compute c=H(C_(x), R, c₀) and confirm that g^(c)R=C_(x) ^(z) ¹         h^(z) ² , the verifier computing device controlling provisioning         of access to a secured resource responsive to the confirmation         that g^(c)R=C_(x) ^(z) ¹ h^(z) ² .

The verifier independently validates the received proof and the verifier makes a determination of access grant or not grant.

In some embodiments, the verifier is a verifier computing system that automatically grants access to one or more secured resources, such as a physical access entry (e.g., mantrap, revolving doors, locked gateway, locked cabinet), and in other embodiments, the system grants access to one or more virtual resources (e.g., administrator access on a computer system, logging into accounts, access to secured sections of webpages), among others.

In another example, a comparison protocol may be established (e.g., to prove some condition whereby a<=b). This can be utilized to establish proof messages whereby it is necessary to indicate that a person is of a particular age, that a person has a particular minimum creditworthiness, a person has a minimum educational attainment, among others.

Consider G to be a discrete log group of prime order p and g and h be generators with unknown discrete logs.

Let numbers q and l be such that

${q - 1} = {2^{N} \leq \frac{p}{2}}$

and two whole numbers a and b such that l≤a≤b<q. Consider commitments A=g^(a)h^(m) ^(a) and B=g^(b)h^(m) ^(b) to a and b, respectively. To prove that a b, the following steps can be taken:

-   -   (1) Prover computes C=BA⁻¹=g^(b−a)h^(m) ^(b) ^(−m) ^(a)         =g^(c)h^(m) ^(c) .     -   (2) Prover produces bit commitments A_(i)=g^(a) ^(i) h^(m) ^(ai)         , B_(i)=g^(b) ^(i) h^(m) ^(bi) , C_(i)=g^(c) ^(i) h^(m) ^(ci)         for i∈{1, . . . , N−1} where a_(i), b_(i) and c_(i) are the i'th         bits of a−1, b−1 and c, respectively. m_(ai), m_(bi) and m_(ci)         are sampled randomly.     -   (3) Prover computes A₀=g^(a) ⁰ h^(m) ^(a0) =A Π_(i=1)         ^(N−1)A_(i) ⁻² ^(i) and likewise B₀=g^(b) ⁰ h^(m) ^(b0) =B         Π_(i=1) ^(N−1)B_(i) ⁻² ^(i) and C₀=g^(c) ⁰ h^(m) ^(c0) =C         Π_(i=1) ^(N−1)C_(i) ⁻² ^(i) .     -   (4) For each i∈{0, 1, . . . , N−1}, the prover does the         following:         -   (4.1) Randomly sample r_(ai), d′_(ai) and z′_(ai).         -   (4.2) Compute R_(ai,ai)=h^(r) ^(ai) and R_(ai,(1−a) _(i)             ₎=h^(z′) ^(ai) (A_(i)g^(−a) ^(i) )^(−d′) ^(ai) .         -   (4.3) Compute d_(ai)=H(A_(i), R_(ai,0), R_(ai,1)).         -   (4.4) Compute z_(ai)=(d_(ai)−d′_(ai))m_(ai)+r_(ai).         -   (4.5) Assign z_(ai,ai)=z_(ai), z_(ai,(1−a) _(i) ₎=z′_(ai),             d′_(ai,a) _(i) =d_(ai)−d′_(ai) and d″_(ai,(1−a) _(i)             ₎=d′_(ai).         -   (4.6) Repeat steps 4.1 through 4.5 for B and C.     -   (5) Prover sends all A_(i), R_(ai,0), R_(ai,1), d″_(ai,o),         z_(ai,0), z_(ai,1), B_(i), R_(bi,0), R_(bi,1), d″_(bi,0),         z_(bi,0), z_(bi,1), C_(i), R_(ci,0), R_(ci,1), d″_(ci,0),         z_(ci,0), z_(ci,1).     -   (6) Verifier checks that A=Π_(i=0) ^(N−1)A_(i) ² ^(i) ,         B=Π_(i=0) ^(N−1)B_(i) ² ^(i) , BA⁻¹=Π_(i=0) ^(N−1)C_(i) ² ^(i) .     -   (7) For each i∈{0, 1, . . . , N−1} the verifier checks that:         -   (7.1) A^(d″) ^(ai,0) R_(ai,0)=h^(z) ^(ai,0)         -   (7.2) (Ag⁻¹)^(H(A) ^(i) ^(,R) ^(ai,0) ^(,R) ^(ai,1) ^()−d″)             ^(ai,0) R_(ai,1)=h^(z) ^(ai,1)         -   (7.3) Check the same conditions for B and C.

Note: It may be that either a or b are known to the verifier. In such a case there is no need to decompose the known number and commitment C will have the same mask exponent as that of the unknown parameter.

In some embodiments, that the client computing device (e.g., the prover) does not send A₀, B₀ and C₀ to reduce the size of its messages. In that case, in step 6, instead of verifying a relation between the bit commitments the verifier derives A₀, B₀ and C₀ independently. This aspect may be particularly useful in low data throughput situations or where storage space is very limited.

The comparison method of some embodiments reduces the problem of comparison to three bit decompositions. As such, the computational burden on the prover consists of about 12N−3 group exponentiations.

In contrast, the method of Belenkiy involves two bit decompositions and N−1 equality maps each consisting of four 2-variable equations and a total of six distinct variables.

As such, it is estimated that each equality map requires at least 8 group exponentiations.

Using the efficient Bit Decomposition implementations of some proposed embodiments, the two decompositions will require a total of 8N−2 group exponentiations. Accordingly, it is estimated that Belenkiy's method requires 16N−10 group exponentiations. This demonstrates that for the proposed method for the comparison protocol is more efficient, and this superiority becomes increasing important as the numbers to be compared scale up.

In particular, the scale up may occur if the credential verification system is utilized across a large number of users.

FIG. 3 is an example system for conducting credential verification, according to some embodiments. The components are shown as an example of one embodiment, and alternatives are also contemplated. The components of the system do not necessarily reside on the same computing device and may be distributed across one or more computing devices.

A computer implemented system 300 for electronic verification of credentials is illustrated. The system includes at least one processor and data storage, and includes a proof request parsing engine 302 configured to receive one or more proof request data structures 304, which in combination represent one or more logical conditions.

A credential parsing engine 306 is provided to receive one or more credentials 308 which in combination, validate one or more characteristics of an identity profile 310 of a prover entity.

A proof generation engine 312 is provided that receives, from a verifier computing system 314, the one or more proof request data structures 304 and the one or more credentials 308; and for each logical condition provided in the one or more proof request data structures, parse the one or more characteristics of the identity profile 310 to determine whether the logical condition has been satisfied.

One or more proof output data structures 316 storing signatures or zero knowledge proofs of satisfaction of a subset or all of the one or more logical conditions is returned by the system (e.g., in the form of data fields). A secure encryption engine 318 and a secure processing enclave 320 may be included, in accordance with various embodiments.

A proof generation engine 312, in some embodiments, resides at or is coupled to a data center of a financial institution, and wherein parsing the one or more characteristics of the identity profile includes invoking an electronic comparison against a stored user profile of the financial institution corresponding to the prover entity. The example implementations are not restricted to such a topology, and other topologies are contemplated, including a cloud/distributed resources based proof generation engine 312.

In other embodiments, the proof generation engine 312 is coupled to the secure processing enclave 320, which may also be coupled to a verifier computing device 314.

In another embodiment, the proof generation engine 312 lies within the prover's user device, thus user data will never be provided to the verifier and the issuer will not be informed of the transaction taking place.

In another aspect, the electronic comparison against the stored user profile of the financial institution corresponding to the prover entity includes querying one or more attributes of the stored user profile and comparing the queried one or more attributes against the one or more logical conditions to determine whether individual logical conditions of the one or more logical conditions have been satisfied. The characteristics and attributes of the user profile can be used established and stored thereon the portable client computing device as one or more token data objects that can be received from or computed jointly in a multiparty protocol with an issuer computing device.

The one or more token data objects are generated (e.g., as signed objects or encrypted objects) using at least an issuer computing device private issuance key. The one or more token data objects each including one or more signed data elements representing at least one of the one or more characteristics of the client associated with the portable client computing device.

In another aspect, the verifier computing system is configured to encapsulate the one or more credentials along with the one or more proof request data structures in a single data container transmitted to the proof generation engine.

O-Auth Based Design

FIG. 4 is an example O-Auth token based method, according to some embodiments. The O-Auth based method portrayed does not address the issue of unlinkability, and in this example, the prover computing device electronically communicates to the verifier O-Auth tokens containing the verifier's proof request, which the verifier computing system can use to formulate a query message to be transmitted to the issuer computing system, and receive a yes/no answer in response. A benefit to this approach is that there is relatively light infrastructure required, it is very efficient, and the cryptography is simple and flexible.

However, the issuer computing system needs to be available (e.g., online) to be able to process the request. In response to a proof request, the prover confers an OAuth token (not to be confused with credentials) that the verifier can use to query the issuer and be assured that the prover does indeed satisfy their policy.

The verifier is provided tokens containing the verifier's proof request which can be used to query a computing system associated with an issuer, receiving an answer, such as a yes or no response (e.g., or a Boolean variable, such as TRUE/FALSE, 0, 1).

Secure Enclave

A challenging technical problem occurs in implementing a system where the verifier is able to ensure the prover has the correct credentials, while preserving their privacy. In some embodiments, a secure enclave based approach is described. In order to implement a secure enclave, Intel Software Guard Extensions™ (SGX) can be utilized, among others.

There are different mechanisms for public key cryptography. An approach, for example, supported by the Intel SGX SDK natively supports ECDH for key encapsulation and ECDSA for digital signatures over the PRIME256V1 (also known as SECP256R1) curve. Other approaches are possible, such as Schnorr's, which would serve just as well for a digital signature scheme. 256-bit base fields may potentially provide sufficient security.

For symmetric cryptography, Intel SGX SDK™ natively supports 128-bit AESGCM. This primitive can be used for authenticated encryption. It remains to be seen if larger AES key sizes are necessary. In that case, Galois-Counter Mode cannot be used.

Hashing can be performed using SHA-2, as this is natively supported by the Intel SGX™ SDK. As it supports 256-bit blocks, it would also be useful in case of a migration to larger AES blocks; both as a means of key derivation as well of a MAC building block.

The secure enclave approach improves computational efficiency and minimizes a trusted computing base, rendering it more amenable to formal analysis. The verifier may include a verify oracle, which is a trusted software/hardware component hosted by an untrusted third party. It is allowed to view a prover's attributes in the clear and attest that they satisfy a certain predicate queried by the verifier.

An example registration protocol is provided as follows. First, a prover generates their public key. The issuer hands the prover a random string r, the prover generates sk′_(p) and generates pk_(p)=f(sk_(p)) for sk_(p)=(sk′_(p),r) and common knowledge collision resistant function f. In order for the registration to be accepted, the prover should prove to the issuer in zero knowledge that it knows a corresponding sk′_(p). The (semi-honest) issuer's contribution to key generation is to keep a malicious prover from stealing credentials belonging to a previously revealed private key.

In regard to credential subletting, it may be beneficial that the issuer should demand the prover to incorporate some important secret about their account (not even known by the issuer) into the private key, such that the secret can be inferred from the private key. This will discourage provers from sharing credentials with one another. Alice may be willing to let Bob use some credential issued to her by her bank, but not be comfortable giving him complete control over her bank account.

Another possible technique to approach this is to issue credentials to specific devices, using private keys that the device can create for an application and sign using them on the application's behalf, without ever sharing the key with the application.

An example issuer protocol is described:

The issuer generates a signature on the prover's attributes using an arbitrary signature scheme that is secure against existential forgery. For the construction to be secure, the signature should also involve a description of the token's data structure.

More formally, the prover and the issuer agree on a string a_(p) representing the prover's attributes. The issuer knows the prover as the owner of pk_(p), satisfying a_(p). The issuer sends the prover back a signature σ_(i)=sig(sk_(i);pk_(p)∥a_(p)) to the prover.

It is not strictly speaking necessary for the prover to have a public key at all. However, if the issuer enforces limits on how often it would register a new public key for a client, provers will be discouraged from subletting their credentials to one another. This stands in opposition to keyless credentials, where disclosing the secrets to a credential doesn't cost the original owner anything.

An example protocol for showing verification by the oracle is provided.

Let the prover and the verifier both trust a verification oracle known by the key pair (sk_(o),pk_(o)).

The verifier chooses a random challenge c and sends it to the prover. A proof request predicate P is agreed upon. The prover composes the string d=(pk_(i)∥sk_(p)∥a_(p)∥σ_(p)∥c∥P) and sends enc(pk_(o);d) to the oracle.

The oracle decrypts d and checks that the following propositions are satisfied:

sig ver(pk _(i);σ_(i) ;f(sk _(p))∥a _(p))

P(pk _(i) ,a _(p))

In case of successful verification, the oracle outputs σ_(o)=sig(sk_(o);c∥P) or it outputs ⊥ otherwise.

The verifier only needs to check that sig ver(pk_(o);σ_(o);c∥P) holds.

Note that as regards propositions P that do not depend on anything outside a_(p) (e.g., time) there is no freshness requirement; therefore the challenge c can simply be regarded to be the empty string in such cases.

For examining the approach security, the following collusion scenarios are considered:

Malicious issuer and prover to break soundness: This attack can be trivially mounted and in some embodiments, there is not attempt to prevent it. The issuer can always issue bogus adaptively chosen untruthful credentials for an accomplice prover. In practice, such a problem is best thwarted by strong and transparent authentication and KYC practices by issuers, as well as careful choice of trusted issuers by verifier consortiums based on thorough vetting.

Malicious issuer and verifier to break zero-knowledge: Zero-knowledge in this context means that an adversary controlling all issuers and verifiers cannot pinpoint which of the trusted issuers implied by the query and which of the credentials obtained from the issuer the credential in use is. For this, the analysis makes use of the CCA2 property of the encryption scheme used in Acquire Proof queries.

More formally, consider the following game, where the adversary is allowed to make polynomially many of the following queries, interleaved with polynomial computations:

-   -   Create Honest Oracle: Generate (sk_(o),pk_(o)) and add pk_(o) to         the set O_(honest) known to the adversary.     -   Confer Credential: Send (σ_(i)=sig(sk_(i),pk_(p)∥a_(p)),pk_(i))         for arbitrary a_(p) and arbitrary key pairs (sk_(i),pk_(i)) and         (sk_(p),pk_(p)).     -   Request Challenge: Send arbitrary pk_(o)∈O_(honest), P and c to         the challenger. The challenger picks a random element d from the         set D={(pk_(i)∥sk_(p)∥a_(p)∥σ_(i)∥c∥P)|P(pk_(i),σ_(i))} and         sends enc(pk_(o);d) back to the adversary.

The adversary wins if D is non-empty and he can guess the value of d with non-negligible advantage over a random choice.

A simulation argument naturally follows from this intuition and is therefore avoided.

Malicious prover to break soundness: The adversary is allowed polynomially many queries from the following list; arbitrarily interleaved with one another and polynomial-time computations.

-   -   Create Honest Issuer: Create a new key pair (sk_(i),pk_(i)) and         add pk_(i) to the set I_(honest) available to the adversary.     -   Create Honest Oracle: Create a new key pair (sk_(o),pk_(o)) and         add pk_(o) to the set O_(honest) available to the adversary.     -   Initiate Registration: Receive a random string r from an honest         issuer.     -   Finish Registration: Send (r,pk_(p),π) to an honest issuer that         has sent r in a past Initiate Registration query. If π         non-interactively proves knowledge of sk′_(p) such that         pk_(p)=f(sk′_(p),r), the issuer will later accept Acquire         Credentials queries from the adversary.     -   Finish Honest Registration: Create an honest prover to respond         to an already initiated registration process sk′_(p) will be         hidden from the adversary, but pk_(p) will be known and added to         the set P_(honest).     -   Acquire Credentials: Acquire σ_(i)=sig(sk_(i);pk_(p),a_(p)) for         arbitrary a_(p) and the additional requirement that pk_(p) has         been already registered with the owner of sk_(i). Add         (pk_(i),a_(p)) to the set A.     -   Acquire Proof: Submit enc(pk_(o);d) an arbitrary but well-formed         d=(pk_(i)∥sk_(p)∥a_(p)∥σ_(p)∥c∥P) to an honest oracle with key         pk_(o) and acquire the output σ_(o).     -   Acquire Honest Proof Request: Send arbitrary (P,c,pk_(o)) to an         honest prover and receive enc(pk_(o);d) if the prover has a         credential attesting to P and ⊥ otherwise. Add c to the set         C_(outsourced).     -   Forge: The adversary outputs some σ_(o), and the game ends. She         wins if:         -   1. sig ver(pk_(o);σ_(o);c∥P) for some c and P.         -   2. c∉C_(outsourced)         -   3. pk_(o)∈O_(honest)         -   4.             (pk_(i),a_(p))∈A: pk_(i)∈I_(honest), P(pk_(i),a_(p))         -   5. ∀pk_(i)∉I_(honest),a_(p): ¬P(pk_(i),a_(p))

There are no queries regarding corrupted or corruptible Issuers and Oracles since such parties can be simulated by the adversary herself.

FIG. 5A is an example method diagram where a secure enclave master verifier is utilized, according to some embodiments.

In FIG. 5A, the issuer computing system signs attributes with a cryptographic technique, the verifier computing system sends issuer computing system a challenge and proof request.

In response, the prover computing device sends encrypted credential, challenge and proof request to a master verifier computing device. The master verifier signs challenge and proof request computing device.

This approach, while requiring additional infrastructure relative to the approach of FIG. 4, satisfies many of the conditions for an ideal verification. The issuer computing system does not obtain further information (e.g., the identity of the verifier) from the verification event.

FIG. 5B is a state diagram of a verify oracle, according to some embodiments. The verify oracle can be implemented using software, hardware, or a combination thereof. For example, the states may be transitioned through the use of a processor configured to transition between one or more states, and to perform steps described below in conjunction with machine-interpretable instruction sets.

A Verify Oracle supports three states:

-   -   1. Blank: At this state, only the initRemoteAttestation call         would be accepted. Then, the first remote attestation message         will be generated the enclave goes to the Remote Attestation         state.     -   2. Remote Attestation: At this state, the enclave accepts either         a reset call or a finishRemoteAttestation call. Upon a reset         call, the enclave clears all of its state data, as if it were         killed and reloaded. Upon a finishRemoteAttestation call, the         enclave consumes a Remote Attestation challenge message. The         enclave produces a Remote Attestation message 3, generates the         necessary key pairs and outputs the Remote Attestation message         and the public keys. If any of this fails, it performs a reset         operation.     -   3. Ready: This is the state wherein the enclave can actually         evaluate policies over attributes. It can receive a         checkProofRequest call, or a reset call.

Trust by Provers and Verifiers is assumed in all the previously described models as a common reference. Also, for obvious performance concerns, it is vital to be able to perform Remote Attestation on an enclave non-interactively. As such, the enclave's host can perform a publicly verifiable remote attestation with its enclave and publish the transcript to it. In order to do so, she may employ the Fiat-Shamir heuristic using the collision-resistant function H(.) modeled as a Random Oracle. If the Remote Attestation Verifier would normally use a probabilistic polynomial-time algorithm m2←A(m1;r) to generate the second message, in this scenario the second message would be derived through m₂←A(m₁;H(m₁)).

A proof request can be defined in accordance with variations of the following examples.

The language describing policies should be simple to interpret so as not to expose the system to security risks.

In order to prevent the execution from leaking information about the attributes, the language should preclude programs with data-dependent access patterns, runtime and execution paths. Here, a C-like language called StraightTalk is described as an example, and it is only capable of describing straight-line programs:

(policy) ::= (token-definition) (statement)* (expression) (token-definition) ::= ϵ  | (token) ‘(’ (variable-definition)* ‘)’ (variable-definition) ::= (type) (identifier-list) ‘;’ (identifier-list) ::= (identifier)  | (identifier-list) ‘,’ (identifier) (type) ::= (basic-type)  | (basic-type) ‘[’ (integer) ‘]’ (basic-type) ::= ‘unsigned’ ‘int’ ‘[’ (integer) ‘]’  | ‘int’ ‘[’ (integer) ‘]’  | ‘float’ (statement) ::= (variable-definition)  | (expression)‘;’ (argument-list) ::= ϵ  | (nonempty-argument-list) (nonempty-argument-list) ::= ( (expression) ‘,’)* (expression) (expression) ::= (expression) ‘?’ (expression) ‘:’ (expression)  | (expression) (binary-operator) (expression)  | (unary-operator) (expression)  | (function-like-operator) ‘(’ (argument-list) ‘)’  | ‘(’ (expression) ‘)’  | (string)  | (base64)  | (indentifier)‘[’(integer)‘]’  | (indentifier)‘[‘(integer)‘]’‘[’(integer)‘]’  | (identifier)  | (number) (unary-operator) ::= ‘

’  | ‘

’ (binary-operator) ::= ‘=’  | ‘

=’  | ‘+’  | ...

indicates data missing or illegible when filed

FIG. 6A is a system diagram providing additional detail in the context of a verifier hosted enclave, according to some embodiments. As shown in FIG. 6A, the verifier enclave stores a secret key which is utilized in a flow of signed messages. The key encapsulation process, in various embodiments, includes 2-way or 1-way authenticated public key encryption.

FIG. 6B is a simplified diagram providing additional detail in the context of a verifier hosted enclave, according to some embodiments. In FIG. 6B, the verifier receives the proof request, the proof request, and the proofs directly from the prover or prover device, and transmits a proof verification message to the verifier.

In this example, the secure enclave is adapted for processing encrypted credentials, challenges, and proof requests. The secure enclave can be a processor or a secured memory location that is configured for maintaining a verifier secret key utilized to generate a first signed message.

The verifier computing device receives, from a prover computing device, a second signed message including at least an enclosed issuer signed message representing one or more encrypted containers storing at least one or more characteristics of an identity profile of a prover entity along with a message authentication code based at least on the proof request data structure.

The verifier computing device then transmits the second signed message, the proof request data structure, and the one or more encrypted containers to the secure enclave.

The verifier computing device then receives a response data message from the secure enclave indicative of whether all of the one or more logical conditions were satisfied by the at least one or more characteristics of the identity profile of the prover entity. In some embodiments, the secure enclave is configured to provide publicly verifiable remote attestation with a verifiable threat model and a verifiable proof of security.

A remote attestation protocol involves a zero knowledge proof with a prover and a verifier, the enclave being the prover. A direct run of this protocol by both Identity Brokerage parties (prover and verifier) may compromise efficiency. Therefore, a mechanism is implemented using the Fiat-Shamir heuristic, and the enclave's maintainer is configured to run an instance of remote attestation in a publicly verifiable manner.

Instead of using actual random inputs, the remote attestation verifier (the enclave's maintainer) replaces every randomness with the output of a pseudorandom function applied to the entire protocol transcript up until that moment, and an arbitrary initial nonce. Thus, by presenting the transcript of this protocol instance, the enclave's maintainer can efficiently convince the identity brokerage parties that the enclave is a trustworthy one.

In some embodiments, the verifier enclave or a third party hosted system tracks records transcripts of an exchange, which are exposed to the public. For example, it may be the responsibility of a verifier computing system to run a remote attestation protocol with its enclave once whereby the enclave communicates its public key, which is then stored in on a transcript exposure module, which may be hosted by any one of the computing systems associated with any one of the parties or by a third party hosted system. In order to establish the honesty of the transcript, all the randomness used on the verifier's cryptography are to be created using a pseudorandom function (hash, block cipher, etc.) involving all or some of the information available to the verifier's computing device at a time of a credential validation transaction.

The secure enclave processor maintains a verification transcript in relation to its own credentials, as the enclave is wholly trusted by both the prover and the verifier, it should be strongly vetted itself.

Chip manufacturers provide mechanisms to verify an enclave involving multi-round interactive protocols. Remote attestation is a protocol based on bilinear group signatures, whereby an enclave proves to a third party that it is running on a legitimate Intel SGX platform, and that is running a particular program.

FIG. 7 is a method diagram providing an example issuer sequence where the prover computing system has a corresponding key pair, according to some embodiments.

FIG. 8 is a method diagram providing an example verification sequence, where the prover computing system has a corresponding key pair, according to some embodiments.

FIG. 9 is a method diagram providing an example issuer sequence where the prover computing system does not have a corresponding key pair, according to some embodiments.

FIG. 10 is a method diagram providing an example verification sequence, where the prover computing system does not have a corresponding key pair, according to some embodiments.

FIG. 11 is a system diagram providing an example verification system having a third party hosted enclave, according to some embodiments.

FIG. 12 is an example C-based proof request description language, according to some embodiments. An example proof request is shown in FIG. 12, and other policies are possible. In some embodiments, the policies can be compiled from a simple C-like language only capable of writing straight-line non-branching programs.

Anonymous Credentials

In some circumstances, it is desirable to be able to provide credentials in an anonymous manner. For example, one may wish to be able to prove that they reside in a particular area without disclosing their address (e.g., that they reside within a radius of a particular place or location). For example, a local coffee shop may wish to provide loyalty pricing to local customers. Another example is only allowing people to vote on a local issue if they reside in a particular neighborhood. I.e., only provide access to a service or benefit to people that reside in a particular area without those residents having to disclose their address.

In some embodiments, the location may be determined within a radius from a location. In other embodiments, other shapes, such as triangles or rectangles may be used.

In some embodiments, polar coordinates (longitude and latitude) are used as a point for a particular location or a user's address. The polar coordinates of the user's address may be certified by an authority (e.g., department of motor vehicles) and inputted into a user-centric protocol (e.g., U-Prove) to determine a Commitment to the polar coordinate. The Commitment may then be inputted into a system to anonymously confirm that the Commitment is within a distance from a particular location (another e.g., polar coordinate). In some embodiments, the address coordinates and/or Commitments may be presented in the form of a token.

In some embodiments, a business may present a QR code to a customer to provide an extra service or benefit (e.g., cost reduction) based on the address of the customer. The customer's device that scanned the QR code could use a U-Prove presentation protocol to provide a commitment to their address provided by an authority. A verifier would then prove that the customer is within the geographic area for the business by confirming that the commitment is within a distance from the business.

FIG. 13 is an example method diagram for an anonymous credentials approach, according to some embodiments. The approach utilizes advanced cryptography for issuance and presentation protocols, and has relatively fewer infrastructure requirements and is unlinkable and flexible. Anonymous Credentials is aimed at solving the problem of identity brokerage through designs depending on cryptographic hardness assumptions.

In such an approach, a custom-built signature mechanism is used for the issuance protocol that is amenable with the type of zero-knowledge proofs of knowledge approaches used in the proof protocol. Notable examples are U-Prove (relying on Diffie-Hellman type hardness assumptions), Idemix (relying on RSA-type hardness assumptions) and later approaches based on bilinear maps.

FIG. 14 illustrates, in a component diagram, an example of a module breakdown of an identity brokerage 1400, in accordance with some embodiments. The identity brokerage 1400 comprises a d log-utils unit 1410, a zk-d log unit 1420, a sigma-protocols unit 1430, a user-centric identity unit 1440 (e.g., uprove) and an identity-brokerage unit 1450. The d log-utils unit 1410 may comprise prime-order groups, their associated Z_(p) fields, standard generators, hash functions, etc. In some embodiments, the d log-utils unit 1410 may include the following classes: Group, Group Element, Field, Field Element, Vectors, Hash Functions, Randomizers and Test Utilities. The zk-d log unit 1420 may comprise basic data structures used in zero-knowledge protocols using discrete log (e.g., Pedersen Commitments), etc. In some embodiments, the zk-d log unit 1420 may include the Pedersen Commitment class. The sigma-protocols unit 1430 may include the following classes: Provers, Verifiers, Problems and Proofs. The sigma-protocols unit 1430 will be described in further detail below. An example of a user-centric identity module 1440 may comprise a bare bone implementation of the U-Prove Issuance and Presentation protocols. The identity-brokerage unit 1450 may put all the units together, hiding the cryptography from the user.

In some embodiments, a token is a list of integers with structure. Table 1 illustrates an example of a token:

TABLE 1 Example 1 of a Token Name #1 Value #1 Name #2 Value #2 Name #3 Value #3 Name #4 Value #4 First Frederick Last Krueger Occupation Nightmare Work 1428 Name Name Monster Address Elm Street

Table 2 illustrates another example of a token where the first attribute is dedicated to describing the token's structure:

TABLE 2 Example 2 of a Token Token Structure Value #1 Value #2 Value #3 Value #4 [“First Name”, Frederick Krueger Nightmare 1428 Elm “Last Name”, “Occupation”, Monster Street “Work Address”]

With respect to security, the first example of Table 1 only reveals the number of attributes in a token, while the second example of Table 2 also reveals the entire structure of the token.

With respect to performance, the first example of Table 1 requires double the number of actual attributes, while the second example of Table 2 only demands one extra attribute.

Σ-Protocols

The sigma-protocol unit 1430 will now be described in more detail.

A sigma-protocol (Σ-protocol) is a schema for proving knowledge of a witness w to an NP-Statement x∈L. It comprises the following three moves:

-   -   1. Commitment: The prover sends commitments to random values         (referred to as “masks” herein) to the verifier.     -   2. The verifier sends a random challenge back to the prover.     -   3. The prover provides a response incorporating the mask values,         the witness and the challenge.

The verifier accepts if and only if the components of their view satisfy a certain polynomially-verifiable relation. The view includes are the problem statement P(x) and the three messages exchanged.

A Σ-protocol should also satisfy the following properties:

-   -   1. Special Soundness: An extractor can extract a witness from         two accepting transcripts of the protocol with equal commitments         and different challenges.     -   2. Special Honest Verifier Zero Knowledge: An honest verifier         can generate transcripts identically distributed as an actual         execution of the protocol, given a challenge.

It should be noted that the concept of a Σ-protocol is much broader than the algebraic cases used in this solution. Namely there is very little limitation on the mathematical nature of the NP-Statement to be proven, its witness, and the commitment scheme in use.

It should also be noted that it is not sufficient for the challenge to be unique. It should be unpredictable. From the Special Zero Knowledge property it follows that a malicious prover can fool a verifier if able to guess the challenge prior to commitment generation.

It should also be noted that even though a proof of knowledge, a Σ-protocol is not necessarily zero-knowledge, nor composeable in parallel.

Composing Σ-Protocols Disjunction

In some embodiments, in order to prove that at least one of the two statements A and B is true, the prover proves one (one that is actually true) and simulates the other (which the zero knowledge property guarantees to be possible, regardless of its truth). In order to allow the prover to simulate one and only one of the two, for each verifier challenge c an efficient and efficiently invertible bijective function f_(c): C→C, where C is the set of possible challenges is devised. The prover may use arbitrary challenges c₁ and c₂ for its subproofs, as long as c₂=f_(c)(c₁). Intuitively, the prover can fix one of the challenges and generate bogus commitments. After receiving the uniformly random verifier challenge, the prover will be bound to a uniformly distributed challenge for the other statement, which forces it to try and prove it honestly.

Special Soundness:

Imagine two accepting executions of the proof with the same mask commitments and different verifier challenges. Represent the two transcripts as ((R₁, c₁, z₁), (R₂, c₂, z₂)) and ((R′₁,c′₁,z′₁),(R′₂,c′₂,z′₂). We have the following:

R ₁ =R′ ₁

R ₂ =R′ ₂

c ₁ +c ₂ ≠c′ ₁ +c′ ₂ ⇒c ₁ ≠c′ ₁ or c ₂ ≠c′ ₂.

Without loss of generality, let us assume that c₁≠c′₁. Because (R₁, c₁, z₁) and (R₁, c′₁, z′₁) are both accepting transcripts, a witness w₁ can be extracted for the first statement, demonstrating that the prover knew it was true, as well as a witness to its truth.

Special Zero-Knowledge:

The simulator can sample c and c₁ in advance and derive c₂ from the two. Because the protocols for the sub-statements are zero-knowledge, the simulator can output (R₁, c₁, z₁) and (R₂, c₂, z₂) that are indistinguishable from honest transcripts, given the challenges. But c₁ and c₂ are uniformly distributed, therefore the simulated transcripts are indistinguishable from honest transcripts.

Cost:

The computational overhead is negligible compared to that of providing the honest and simulated proofs, both in providing honest or simulated proofs and verifying them.

Communication has an overhead of the prover sending one of the sub-challenges to the verifier.

It should be noted that the necessity of actually implementing proof simulators to build disjunction provers makes their efficiency relevant. Therefore, most complexity analyses in this document will include an estimation of the work required to simulate a proof.

It should also be noted that such differences do not enable timing attacks when disjunctions of two statements of the same form are proven. However, whenever P₁∨P₂ is to be proven, care should be taken to ensure that the timing difference between honest P₁ and simulated P₁ is the same as the timing difference between honest P₂ and simulated P₂. In other words, in order to maintain zero knowledge one needs to guarantee that

t _(P) ₁ +t _(p2) ^(sim) =t _(P) ₁ ^(sim) +t _(P) ₂ ⇔t _(P) ₁ ^(sim) −t _(P) ₁ =t _(P) ₂ ^(sim) −t _(P) ₂ .

Conjunction

One may need to prove knowledge of all statements P₁, . . . ,P_(N), each with their own Σ-protocol. That is simply achieved through synchronizing the execution of their proof protocols. Meaning that all commitments R₁, . . . , R_(N) are sent first and the same challenge c is used to provide all responses z₁, . . . , Z_(N).

Special Soundness:

Take two accepting transcripts (R₁, . . . , R_(N), c, z₁, . . . , Z_(N)) and (R₁, . . . , R_(N), c′, z′₁, . . . z′_(N)). From the soundness of each sub-protocol we deduce that all w_(n)'s can be extracted.

Special Zero-Knowledge:

Given the challenge c beforehand, the sub-simulators can each create honest-looking transcripts (R_(n), c, z_(n)). Clearly a sequence of such transcripts will also be honest-looking.

From Σ to ZKPoK

A Σ-protocol is not guaranteed to be Zero Knowledge. However, under certain black-box transformations, a Σ-protocol can be converted into a Zero Knowledge Proof of Knowledge (ZKPoK).

One such transformation uses the Fiat-Shamir heuristic. Prior to the execution of the Σ-protocol, the verifier hands the prover a challenge string, later used in generating the Σ-protocol challenge. The main body of the protocol is made non-interactive, as the prover self-generates the challenge by hashing together the verifier-provided challenge string and its own commitments.

Roughly speaking, by having both parties contribute freshness to the hash input, the challenge is guaranteed to be unpredictable, in the sense that neither can guarantee any meaningful relation between the prover commitments and the challenge with non-negligible probability, essentially incapacitating them both from cooking up any mischief. With both parties limited to honest behavior, the special soundness and special zero knowledge properties suffice to guarantee the zero knowledge and proof of knowledge conditions.

It should be noted that the challenge string provided by the verifier need not be random; uniqueness suffices.

Zero-Knowledge:

The transcript of an honest prover's interaction with any verifier is identically distributed as with an honest verifier. Since good randomness from the prover alone suffices to guarantee randomness of the challenge, regardless of what the verifier contributes into the hash input, the challenge will be honestly produced.

An honest prover's view under the Σ-protocol is identically distributed as that under the transformed protocol.

Proof of Knowledge:

In a Random Oracle model, we can rewind the challenge creation step and have two distinct challenges that the prover can successfully respond to.

By making the protocol non-interactive, the transformation also addresses the issue of composability. Reducing the number of messages from 3 to 2 somewhat trivially guarantees parallel composability. Moreover, all zero-knowledge protocols are sequentially composeable.

This makes Σ-protocols very valuable tools, mainly because proving Special Soundness and Special Honest Verifier Zero Knowledge is much easier than proving Arbitrary-Verifier Zero Knowledge and Proof of Knowledge.

Algebraic Implementations

Operations are carried out in a prime order group G and the field

of integers modulo its size. This group has at least two publicly known elements g and h, along with a hash function H. The security of our constructions depends on the following properties.

Security Assumptions

In some embodiments, the following assumption are made:

-   -   1. Generator Independence: No efficient algorithm can output         nonzero vector [w₁ w₂] such that g^(w) ¹ h^(w) ² =e.     -   2. Discrete Log Hardness: No efficient algorithm can output r         given h^(r) for exponentially many uniformly sampled r∈         .     -   3. There is a publicly known hash function H:         (VerifierChallenge, G*)→         , that can be used to transform a Σ-protocol on G into a ZKPoK         under the Fiat-Shamir heuristic. A Σ-protocol operates on G iff         R∈G,{c,z}⊂         for all its executions.

Schnorr Signature

This protocol allows an entity to prove knowledge of the discrete log x (private key) of a group element X=g^(x) (public key) by providing a valid response (signature) to a challenge (message). The non-interactive version of this protocol can serve as a signature scheme with the verifier challenge serving as the message to be signed.

As a Σ-protocol, the following steps are to be taken:

-   -   1. Prover randomizes mask r and provides R=g^(r).     -   2. Prover receives challenge c∈F_(|G|).     -   3. Prover sends z=cx+r.     -   4. Verifier accepts iff g^(z)=RX^(c).

Completeness is evident. The following proves security:

Special Soundness:

Imagine two distinct transcripts with identical commitment and different challenges.

X ^(−c) ¹ g ^(z) ¹ =X ^(−c) ² g ^(z) ² =R⇔X ^(c) ¹ ^(−c) ² =g ^(z) ¹ ^(−z) ² ⇔X=g ^((z) ¹ ^(−z) ² ^()(c) ¹ ^(−c) ² ⁾ ⁻¹ .

Thus, a witness can be extracted.

Special Zero-Knowledge:

To counterfeit an accepting transcript, the simulator can first randomize the challenge and the response c, z∈F_(|G|). It then generates fake mask commitment:

R=g ^(z) X ^(−c).

It should be noted that, in some cases the simulator may be given the challenge c. Therefore, it's best to prove the slightly stronger result that a simulator can generate transcripts that are indistinguishable from honest ones given the challenge.

The following proves that real and fake transcripts are identically distributed:

Random variables are represented with boldface capital letters. C, Z and R represent the challenge, response and the mask respectively.

In both cases, the challenge is uniformly distributed. In other words, C˜U(

).

In the counterfeit case, the response is generated independently of the challenge, therefore Z|C˜U(

).

In the honest case, the response is obtained by adding a uniformly randomized r to a fixed multiple of c. Therefore, in that case also we have Z|C˜U(

).

In both cases, R is uniquely determined from c, z and X. Therefore, the random variable (Z, C, R) is identically distributed across the two cases.

Thus the protocol is Honest-Verifier Zero Knowledge in the strongest sense, namely, information theoretically.

Computational Complexity:

TABLE 3 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 1 0 1 1 Simulator 2 1 0 1 Verifier 2 1 0 0

Note on Complexity

All complexity estimates ignore the process of creating and communicating the challenge, because it can be amortized. Moreover, sometimes it is handed down from another protocol.

Note on Computational Complexity

Every group exponentiation involves θ(log|G|) group doublings and compositions. This number is considerable, at least about 256.

Every group doubling or composition in turn, involves a constant number of Field multiplications and inversions.

And finally, every field multiplication involves θ(log|G|) field additions, which is again at least about 256. This means that compared to a group exponentiation, a field addition, subtraction or negation takes a negligible 2⁻¹⁶=0.000015 time and effort. Therefore, to save ourselves and the readers a fair bit of misery, we shall hereon dismiss basic field operations as inexpensive, reasonably certain that our analysis will not suffer much.

Communication Complexity

1 field and 1 group element.

Note on Communication Complexity

In many contexts, we may assume that transmitting a group element requires more or less the same number of bits as a field element does. Even so, more work may be required on the receiver's side to reconstruct a representation amenable to manipulation.

Generalized Schnorr's

Schnorr's signature can be naturally extended to efficiently prove knowledge of a group element X's discrete logarithm based multi-generator set {g_(n)}. In addition, the prover may want to prove that some of these exponents are equal.

Prover knows X=Π_(n=1) ^(N)g^(x) ^(i(n)) , where i(n):

→

surjectively maps an exponent's index to that of its equality class. That is to say, there are l≤N equality classes, indexed from 1 to l.

The prover does the following:

-   -   1. For each equality class i sample

$r_{i}\overset{U}{\leftarrow}{\mathbb{Z}}_{G}$

-   -   2. Send the commitment R=Π_(n=1) ^(N)g_(n) ^(r) ^(i(n))     -   3. Receive challenge c∈         .     -   4. For each equality class i send the response         z_(i)=cx_(i)+r_(i)

The verifier accepts if and only if RX^(c)=Π_(n=1) ^(N)g_(n) ^(z) ^(i(n)) .

Special Soundness:

Consider two transcripts (R,c,z₁, . . . z₁),(R,c′,z′₁, . . . z′₁). We have:

$R = {{X^{- c}{\prod\limits_{n = 1}^{N}\; g^{z_{i{(n)}}}}} = {\left. {X^{- c^{\prime}}{\prod\limits_{n = 1}^{N}\; g^{z_{i{(n)}}^{\prime}}}}\Rightarrow X^{c - c^{\prime}} \right. = {\left. {\prod\limits_{n = 1}^{N}\; g^{z_{i{(n)}} - z_{i{(n)}}^{\prime}}}\Rightarrow X \right. = {\prod\limits_{n = 1}^{N}\; g^{{({z_{i{(n)}} - z_{i{(n)}}^{\prime}})}{({c - c^{\prime}})}^{- 1}}}}}}$

This gives us witnesses x_(n)=(z_(i(n))−z′_(i(n)))(c−c′)⁻¹, such that for every n, n′ with i(n)=i(n′) we have x_(n)=x′_(n).

Notice the one-sidedness of the above implication. It is not at all asserted that variables belonging to distinct equality classes hold distinct values.

Special Zero-Knowledge:

For a given challenge c∈

, the simulator uniformly samples z₁, . . . z_(l) and computes R=X^(−c)Π_(n=1) ^(N)g^(z) ^(i(n)) .

This is identically distributed as an honest transcript. Given a challenge c, the z_(i)s are completely masked by the r_(i)s and therefore uniformly distributed. Finally, as in the simulated case, the commitment R is uniquely determined by the challenge and the responses.

Computational Complexity:

TABLE 4 Field Group Group Multipli- Field exponentiation composition cation randomization Prover N N − 1 I I Simulator N + 1 N 0 I Verifier N + 1 N 0 0

Communication Complexity:

I field and 1 group elements.

Proving Knowledge of a Pedersen Commitment

Proving, verifying and simulating knowledge of commitment X=g^(x)h^(r) is reduced to Generalized Schnorr's with the following parameters:

TABLE 5 Parameter N I g₁ g₂ x₁ x₂ Value 2 2 g  h  x  r 

Computational Complexity:

TABLE 6 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 2 1 2 2 Simulator 3 2 0 2 Verifier 3 2 0 0

Communication Complexity:

2 field and 1 group elements.

Soundness of the Pedersen Commitment Scheme:

If a prover can open a commitment in two ways g^(x)h^(r)=C=g^(x′)h^(r′), we have g^(x−x′)=h^(r′−r). From the assumption that the prover does not know the relative discrete log of g and h, we infer that x-x′=r′-r=0.

Very Generalized Schnorr's

This is called an “Equality Map” in the Microsoft Specifications. The problem is to prove knowledge of the discrete logarithm of a set of group elements {X_(m)} as

$X_{m} = {\prod\limits_{n = 1}^{N}\; g_{n}^{x_{mn}}}$

Moreover, there is an “equality map” as common input, taking the index of an exponent to that of a witness:

l:

×

→

∪{0}

x _(mn) =w _(l(m,n))

w ₀=0

The symbol I stands for the equality map as well as the number of non-trivial witnesses. It should be clear from context which is meant.

The prover performs the following:

-   -   1. For i∈         , sample

$r_{i}\overset{U}{\leftarrow}{{\mathbb{Z}}_{G}.}$

r₀=0 by convention.

-   -   2. For m∈         , send R_(m)=Π_(n=1) ^(N)g_(n) ^(r) ^(i(m,n)) .     -   3. Receive challenge c∈         .     -   4. For i∈         , send back z_(i)=cw_(i)+r₁. z₀=0 by convention.         The verifier accepts if and only if X_(m) ^(c)R_(m)=Π_(n=1)         ^(N)g_(n) ^(z) ^(i(m,n)) for all m∈         .

Special Soundness:

This follows naturally from the special soundness of Generalized Schnorr's. Intuitively, the relevant witnesses for each discrete log relation can be extracted independently of the others. Consistency is still guaranteed.

Special Zero-Knowledge:

Given group elements {X_(m)}, challenge c and equality map I, the simulator samples

${z_{i}\overset{U}{\leftarrow}{\mathbb{Z}}_{G}},$

sets z₀=0 and for m∈

computes R_(m)=X_(m) ^(−c)Π_(n=1) ^(N)g_(n) ^(z) ^(i(m,n)) .

Similarly to previous arguments, in both simulated and genuine cases, the set {z_(i)} is uniform and independent of the challenge c, and the set {R_(m)} is uniquely determined given the two. Therefore, those cases are identically distributed.

Computational Complexity:

Consider the set E={(i, n)|∃m:I(m,n)=i}. One may say |E|≤MN.

Here we make an additional assumption that was not essential to the security analysis but makes complexity analysis easier.

∀m∈

:∃n:I(m,n)≠0

That is, none of the discrete log witness vectors are trivially zero.

TABLE 7 Field Group Group Multipli- Field exponentiation composition cation randomization Prover |E| |E| − M I I Simulator |E| + M |E| 0 I Verifier |E| + M |E| 0 0

Communication Complexity:

I field and M group elements.

Commitment Equality Proof

In order to prove equality of two commitments X₁=g^(x) ¹ h^(r) ¹ and X₂=g^(x) ² h^(r) ² , it is more efficient to devise a specially tailored proof scheme rather than using the generic equality map.

Both parties simply compute X_(Δ)=X₁X₂ ⁻¹=g^(x) ¹ ^(−x) ² h^(r) ¹ ^(−r) ² =g^(x) ^(δ) h^(r) ^(δ) . The prover proves knowledge of log_(h) X_(Δ).

Special Soundness:

From the special soundness of Schnorr's it follows that the extractor can compute r_(δ) such that X_(Δ)=h^(r′) ^(δ) . Assuming that the prover has knowledge of X₁ and X₂ as valid commitments, it should be able to compute g^(x) ^(δ) h^(r) ^(δ) =h^(r′) ^(δ) ⇔g^(x) ^(δ) h^(r) ^(δ) ^(−r′) ^(δ) =1. Because the prover doesn't know log_(g) h, it must be that x₁−x₂=x_(δ)=0.

Note that this soundness guarantee is only valid if it is already ascertained that the input commitments are valid, which is not the case with the generic equality map.

Special Zero-Knowledge:

This follows directly from the zero-knowledge property of Schnorr's.

Complexity:

The simulator computes X_(Δ), =X₁X₂ ⁻¹ and simulates a Schnorr's. This results in 2 randomizations, 2 exponentiations and one extra composition. Therefore we have an extra exponentiation.

TABLE 8 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 1 1 1 1 Simulator 2 2 0 1 Verifier 2 2 0 0

Commitment Non-Zeroness Proof

In order to prove for a commitment X=g^(x)h^(r) that x≠0, we only need to prove the existence of a multiplicative inverse for x, namely g=X^(x) ⁻¹ h^(−rx) ⁻¹ . In other words, it suffices to prove the discrete log of g base X and h.

Special Soundness:

g=X ^(a) h ^(b)=(g ^(x) h ^(r))^(a) h ^(b) =g ^(xa) h ^(ra+b) ⇔g ^(xa−1) =h ^(−ra−b)

Since the prover doesn't know a nontrivial discrete log relation between the generators, this guarantees that xa−1=0. Therefore, a is the multiplicative inverse of x, guaranteeing that x is nonzero.

Special Zero Knowledge:

This follows directly from the zero knowledge property of the knowledge of commitment protocol.

Complexity:

To set up the discrete log proof, the prover needs to compute x⁻¹ and −rx⁻¹, requiring one field inversion and one multiplication only. The verifier and simulator need no additional setup.

TABLE 9 Group Field Field exponen- Group Field Multipli- random- tiation composition Inversion cation ization Prover 2 1 1 3 2 Simulator 3 2 0 0 2 Verifier 3 2 0 0 0

Inequality Proof—Known Value

Given X=g^(x)h^(r) and Y=g^(y), with y common to both parties and x and r private to the prover, one can prove x≠y by carrying out a non-zeroness proof on XY⁻¹=g^(x−y)h^(r).

As a side effect, this also proves knowledge of x and r.

Special Soundness:

An extractor can obtain x−y and r, with the guarantee that x−y≠0. From that x can also be determined.

Special Zero-Knowledge:

XY⁻¹ is uniquely determined from common inputs X and Y⁻¹ and the subprotocol it is handed to is special zero-knowledge; thus so is this protocol.

Complexity:

TABLE 10 Group Field Field exponen- Group Field Multipli- random- tiation composition Inversion cation ization Prover 2(3) 2 1 3 2 Simulator 3(4) 3 0 0 2 Verifier 3(4) 3 0 0 0

There may be an additional exponentiation required if a party doesn't have Y=g^(y) cached.

Inequality Proof Unknown Values

This works very similarly as with known values. Group elements X₁ and X₂ are common input, and private to the prover are

elements x₁, x₂, r₁, r₂ such that X₁=g^(x) ¹ h^(r) ¹ and X₂=g^(x) ² h^(r) ² .

To prove that x₁≠x₂, the parties both compute X_(Δ)=X₁X₂ ⁻¹. The prover also computes x_(Δ)=x₁−x₂ and r_(Δ)=r₁−r₂ and proves that x_(Δ) is not zero using the commitment non-zeroness proof.

Note that this protocol doesn't prove knowledge of the witnesses x₁, x₂, r₁ and r₂.

Complexity:

TABLE 11 Group Field Field exponen- Group Field Multipli- random- tiation composition Inversion cation ization Prover 2 2 1 3 2 Simulator 3 3 0 0 2 Verifier 3 3 0 0 0

Bit Commitment Proof

Pedersen commitments to bits will play a role in future sections, when comparison of two numbers is of concern. The commitment is of the form C=g^(b)h^(r), where b∈{0, 1} and r∈

. In order to prove that such a commitment is well-formed (that b is indeed a bit) we may have the following:

$b \in \left. \left\{ {0,1} \right\}\Leftrightarrow\left\{ \begin{matrix} {b = {0\mspace{14mu} {or}}} \\ {b = 1} \end{matrix}\Leftrightarrow\left\{ \begin{matrix} {C = {h^{r}\mspace{14mu} {or}}} \\ {C = {gh}^{r}} \end{matrix}\Leftrightarrow\left\{ \begin{matrix} {C = {h^{r}\mspace{14mu} {or}}} \\ {{Cg}^{- 1} = h^{r}} \end{matrix} \right. \right. \right. \right.$

Therefore a disjunction of knowing the discrete log of either C or C_(g) ⁻¹ base h does the trick.

Complexity:

The prover and the verifier both do the additional work of computing C_(g) ⁻¹; namely, an additional group composition.

This results in 3 field randomizations, 3 group exponentiations and 1 composition for the prover, as well as 4 group exponentiations and 3 compositions for the verifier.

There is no additional communication cost.

TABLE 12 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 3 2 1 3 Simulator 4 3 0 3 Verifier 4 3 0 0

It should be noted that the computational burden on the verifier is less important, because it is less likely to be implemented on a mobile device.

Bit Decomposition Proof

Certain properties of committed attributes cannot be naturally expressed using algebraic techniques so far covered in this document. Comparing two numbers is one such example as

doesn't come with a notion of order. It can be done however by a circuit operating on individual bits making up the operands. This means that we need to produce commitments to bits and to simulate binary circuits. However, both of these can be done algebraically. This section describes a method to do the former.

The common input is a commitment C=g^(x)h^(r), with the prover having x and r as private input.

To decompose x into an N-bit number, the prover generates the following:

(b_(N − 1), … , b₀)₂ = x $r_{1},\ldots \;,{r_{N - 1}\overset{U}{\leftarrow}{\mathbb{Z}}_{G}}$ $r_{0} = {r - {\sum\limits_{n = 1}^{N - 1}\; {2^{n}r_{n}}}}$ C_(n) = g^(b_(n))h^(r_(n))

This yields:

${\sum\limits_{n = 0}^{N - 1}\; {2^{n}C_{n}}} = C$

The prover sends C₁, . . . , C_(N−1) to the verifier. Apart from that, the prover will need to provide proofs of commitment for C₀, . . . , C_(N−1).

Special Soundness:

Take two accepting transcripts (C₁, . . . , C_(N−1), R₀, . . . , R_(N−1), c, z₀, . . . , z_(N−1)) and (C₁, . . . , C_(N−1), R₀, . . . , R_(N−1), c′, z′₀, . . . , z′_(N−1)). From the soundness of the conjunction proof we deduce all witnesses w_(n), can be extracted. It should be noted that the fact that the C_0's are created by the prover does not affect the subprotocols' soundness.

Special Zero-Knowledge:

A simulator can randomize group elements (C₁, . . . , C_(N−1)) and have sub-simulators generate honest-looking sub-proofs for their validity as bit commitments.

Complexity:

The prover randomizes N−1 masks and infers r₀ from them. The computation is as follows:

$r_{0} = {{r - {\sum\limits_{n = 1}^{N - 1}\; {2^{n}r_{n}}}} = {r - {2{\left( {r_{1} + {2\left( {r_{2} + \cdots} \right)}} \right).}}}}$

This takes N−1 field additions and N−1 field doublings. In other words, it takes 2N−2 field additions, about as expensive as a couple of multiplications, at most. In most cases though, 2^(N) is much smaller than the group size and therefore the cost of these additions can be disregarded.

Similarly, computing C₁ to C_(N−1) takes N−1 group exponentiations and N−1 group compositions.

In the same way as computing r₀, computing C₀ takes N−1 group doublings and N−1 group compositions. Alternatively, using the availability of r₀, C₀ can be computed directly as C₀=g^(b) ⁰ h^(r) ⁰ . This takes one group composition and one exponentiation. An exponentiation to the power of a large number takes at least about log|G|−1 exponentiations and log|G|−1 doublings alone. Therefore direct computation of C₀ would always be less efficient.

Followed by that is N independent bit commitment proofs.

The verifier, takes C₁ to C_(N−1) and computes C₀, knowing C. That takes N−1 group doublings and N−1 group compositions. The rest of its work is to verify individual bit commitment proofs.

TABLE 13 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 4N − 1 5N − 3 N 4N − 1 Simulator 5N − 1 5N − 2 0 4N − 1 Verifier 4N 5N − 2 0 0

Bit Comparison Proof

Imagine an N-bit comparator design cascaded starting from the most significant bit.

The output of any 1-bit comparator unit comparing the n^(th) digits is a commitment of form:

${C_{n - 1} = {g^{c_{n - 1}}h^{r_{n - 1}}}},{{{where}\mspace{14mu} c_{n}} = \left\{ {\begin{matrix} {{1\mspace{14mu} {if}\mspace{14mu} \left( {a_{N - 1}\mspace{14mu} \ldots \mspace{14mu} a_{n}} \right)_{2}} > \left( {b_{N - 1}\mspace{14mu} \ldots \mspace{14mu} b_{n}} \right)_{2}} \\ {{0\mspace{14mu} {if}\mspace{14mu} \left( {a_{N - 1}\mspace{14mu} \ldots \mspace{14mu} a_{n}} \right)_{2}} = \left( {b_{N - 1}\mspace{14mu} \ldots \mspace{14mu} b_{n}} \right)_{2}} \\ {{{- 1}\mspace{14mu} {if}\mspace{14mu} \left( {a_{N - 1}\mspace{14mu} \ldots \mspace{14mu} a_{n}} \right)_{2}} < \left( {b_{N - 1}\mspace{14mu} \ldots \mspace{14mu} b_{n}} \right)_{2}} \end{matrix}.} \right.}$

The carry in c_(N) is considered 0 and the carry out c₀ is the result.

C_(N−1) can be simply computed as A_(N−1)B_(N−1) ⁻¹=g^(a) ^(N−1) ^(−b) ^(N−1) h^(r) ^(N−1) ^(−r′) ^(N−1) .

All other values are computed as

$c_{n} = \left\{ {\begin{matrix} {{a_{n} - {b_{n}\mspace{14mu} {if}\mspace{14mu} c_{n + 1}}} = 0} \\ {{c_{n + 1}\mspace{14mu} {if}\mspace{14mu} c_{n + 1}} \neq 0} \end{matrix}.} \right.$

This is equivalent to saying (c_(n+1)≠0∧c_(n)=c_(n+1))∨(c_(n+1)=0∧c_(n)=a_(n)−b_(a)). Proving and Simulating c_(n+1)≠0∧c_(n)=c_(n+1):

An honest proof would involve a proof of non-zeroness on C_(n+1) and a Schnorr's as C_(n+1)C_(n) ⁻¹=h^(r).

A simulation would involve a simulation of both subcomponents. Each contributes an extra exponentiation.

TABLE 14 Group Field Field exponen- Group Field Multipli- random- tiation composition Inversion cation ization Prover 3 2 1 4 3 Simulator 5 4 0 0 3 Verifier 5 4 0 0 0 Proving and Simulating c_(n+1)=0∧c_(n)=a_(n)−b_(n):

An honest proof involves a proof of zeroness on C_(n+1) and a proof of equality between A_(n)B_(n) ⁻¹ and C_(n).

A simulation likewise involves simulating the two.

TABLE 15 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 2 2 2 2 Simulator 4 4 0 2 Verifier 4 4 0 0

The most significant work difference between the c_(n+1)≠0 and c_(n+1)=0 cases is an extra field inversion and two field multiplications when c_(n+1)≠0. A number of dummy operations may be necessary to close in the timing gap.

Overall Complexity:

When performing an honest proof, one of the predicates is proven and the other is simulated. When doing a simulation, they both are simulated. Disjunction provers and simulators both sample an additional challenge from the field.

TABLE 16 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 7 6 4 6 Simulator 9 8 0 6 Verifier 9 8 0 0

Whole Number Comparison—Using Comparator Circuits

Assuming decompositions are already available to both parties, the prover generates the bit comparison commitments C_(N−1), . . . , C₀ and prove their correctness. This takes N field randomizations, N exponentiations and N group compositions.

What follows is N−1 comparators with carry ins and a single group composition (providing C_(N−1)).

TABLE 17 Field Group Group Multipli- Field exponentiation composition cation randomization Prover  8N − 7 7N − 6 4(N − 1) 7N − 6 Simulator 10N − 9 9N − 8 0 7N − 6 Verifier 9(N − 1) 8(N − 1) 0 0 Whole Number Comparison—Using Signed Arithmetic (p's Complement)

Imagine a number

$q \leq {\frac{p}{2}.}$

For any two whole numbers 0≤a,b<q, we have the following:

b≤a⇔0≤a−b≤a<q

b>a⇔−q<a−b<0⇔(a−b)mod p>p−q≥q.

q can be as small as the prover feels comfortable, as it puts an upper limit on the values a and b.

This construction essentially reduces comparison between two arbitrary numbers to a comparison between an arbitrary one and one the prover gets to choose. Powers of 2 are very easy to compare against, when equipped with decomposition proofs, which essentially enable us to make statements such as “a is at most N bits long.”

Complexity:

Assuming decompositions of both operands as common input, in order to imply they are at most N bits long, the prover only needs to decompose C=AB⁻¹, again to prove it is at most N bits long. Thus, all that is needed is a group composition and a bit decomposition.

TABLE 18 Field Group Group Multipli- Field exponentiation composition cation randomization Prover 4N − 1 5N − 2 N 4N − 1 Simulator 5N − 1 5N − 1 0 4N − 1 Verifier 4N 5N − 1 0 0

As compared with the circuit based method, this is considerably more efficient, as it requires about half as many exponentiations. However, it is more limited in that it cannot provide a commitment to the comparison result. It only proves the result directly.

Application to Identity Brokerage

Most of these problems start with Pedersen Commitments to finitely many attributes, in the form A_(i)=g^(a) ^(i) h^(r) ^(i) . These may be provided by U-Prove or another Anonymous Credentials protocol. The prover and the verifier have {A_(i)} as common input, and the prover additionally has {a_(b)r_(i)} as private input.

FIG. 15A illustrates, in a flowchart, an example of a method of determining that a geographic point is within a geographic area 1500, in accordance with some embodiments. The method 1500 comprises converting 1502 the geographic into a planar coordinate (dx, dy), determining 1504 a commitment of a geometric function of the planar approximation, determining and generating 1506 a proof that a result of the geometric function of the planar approximation is within parameters, sending 1508 commitment values and proofs to a verifier, and optionally receiving 1510 a confirmation that the result of the formula is correct. The geographic point may comprise a latitudinal coordinate x, and a longitudinal coordinate y (x_(lat), y_(long)). In some embodiments, after the geographic points are converted 1502 into respective planar approximations, a proof portion is generated to prove that that dx=r cos φ₀dθ and dy=rdφ. The geometric function may comprise determining that the geographic point is within at least one of: a radius of another geographic point, a polygonal shape, a union of convex polygonal shapes, a union of shapes (including a combination of circles and polygons). The commitment values may comprise encrypted points and auxiliary values (e.g., areas, radii squared, and other information used by sigma protocols). The commitment values allow the verifier to confirm that the geometric function was applied honestly to the planar coordinate (as further described below). In some embodiments, the proofs may include a proof of well-formedness of a commitment, and a proof of a condition on the result of the geometric function (e.g., distance squared less that radius squared, signed area a positive value, etc.). The result of the geometric function may be compared with desired parameters or conditions such as, a point is within a radius of an origin. Other desired parameters and/or conditions may be used. Other steps may be added to the method 1500.

FIG. 15B illustrates, in a flowchart, an example of a method of proving that a first geographic point is within a radius of another geographic point 1520, in accordance with some embodiments. In some embodiments, the first geographic point may be associated with a credential location of a user device, and the other geometric point may be associated with the origin of an area of interest defined by the origin and the radius. The method 1520 comprises converting 1522 the geographic points into respective planar approximations (dx, dy), determining 1524 a commitment value of a distance squared between the planar approximation of the first geometric location and the planar approximation of the other geometric location (e.g., origin point of region of interest), and generating 1526 a proof that the distance squared between the two points is less than the radius squared (i.e., the distance squared between the planar approximations of the two points is less than the radius squared). In some embodiments, after the geographic points are converted 1522 into respective planar approximations, a proof portion is generated to prove that dx=r cos φ₀dθ and dy=rdφ. Determining a commitment value of a squared value (e.g., squaring a commitment) is described further below. Other steps may be added to the method 1520, including sending 1528 the commitment values and proof to a verifier.

Short Approximate Distance from a Known Point

Let the known point P₀ to be φ₀ radians North and θ₀ radians East. For a close-by point P(φ,θ)=P₀+(dφ,dθ), we may use the following planar approximation:

dy=rdϕ

dx=r cos ϕ₀ dθ

The earth is not a perfect sphere, so the distance from the center at P₀ should be looked up from a database trusted by the verifier and agreed upon by both parties. With r and φ₀ known, computing a commitment to (dx)²+(dy)² can be carried out as follows:

Notation: For entity a, C_(a) denotes a commitment to it.

C_(ϕ)=g^(ϕ)h^(r) ^(ϕ) ,C_(θ)=g^(θ)h^(rθ) is our starting point.

We can compute C_(dϕ)=C_(ϕ)g^(−ϕ) ⁰ =g^(dϕ)h^(r) ^(ϕ) and C_(dθ)=C_(θ)g^(−θ) ⁰ =g^(dθ)h^(r) ^(θ) .

Then we compute C_(cos ϕ) ₀ _(dθ)=(C_(dθ))^(cos ϕ) ⁰ h^(r) for an arbitrary r. For non-integral values, as the cosine is expected to be, this operation is non-trivial and will be covered later in this report.

Then we compute the commitments

$C_{{(\frac{dx}{r})}^{2}}\mspace{14mu} {and}\mspace{14mu} {C_{{(\frac{dy}{r})}^{2}}.}$

A commitment to the distance would be computed as

$\left( {C_{{(\frac{dx}{r})}^{2}} + C_{{(\frac{dy}{r})}^{2}}} \right)^{r}.$

This can be done easily since r is expected to be an integer.

Representing Fractions

A natural idea for representing the fraction m/n in the field of exponents would be to simply use mn⁻¹ in the field. Unfortunately this enables provers to pull off all manners of cheating, as for every m, n and m′, there is an n′ such that m/n=m′/n′ in the field. m/n and m′/n′ need not be equal or even close in Q.

As an example of how dramatically this can go wrong, consider the integer 1000. It can be represented as 1000_(F) in the field. On the other hand, consider the field inverse of 1000, (1000_(F))⁻¹=n_(F). 1000_(F) would also be a representation of 1/n, even though 1000 and 1/n are orders of magnitude away.

Another natural idea is to choose a fixed point representation. Commitments can be added as long as their point position matches (even if it does not, one may be extended or truncated to match the other).

Any fixed point can be multiplied by a commitment to another. The result will have its point at the sum of the others'. When this happens we may need to truncate the result to normalize it.

Normalizing a Fixed-Point Number

Let x be an N-digit number with its point at position n, and that we want to normalize it into x′ with an n′<n bit fractional part. x can be decomposed into N bit-commitments, and the rightmost n-n′ of them discarded. x′ can be built back up from the remaining bit commitments.

Squaring a Commitment

In order to prove the validity of a commitment to x² while having agreed upon a commitment to x C_(x)=g^(x)h^(m), we first rewrite C_(x) ₂ =g^(x) ² h^(m″)=C^(x)h^(m′) knowing m″=m′+xm and then run the following Σ-protocol:

-   -   1. Randomize field elements r₁, r₂ and r₃ and ship commitments         R₁=g^(r) ¹ h^(r) ² and R₂=C_(x) ^(r) ¹ h^(r) ³ .     -   2. Receive challenge c.     -   3. Send z₁=cx+r₁, z₂=cm+r₂, z₃=cm′+r₃.     -   4. Verifier checks that g^(z) ¹ h^(z) ² =C_(x) ^(c)R₁, C_(x)         ^(z) ¹ h^(z) ³ =C_(x) ₂ ^(c)R₂.

Multiplying Commitments

The case of proving the validity of a commitment to xy from those to x and y is only slightly more complex.

C _(x) =g ^(x) h ^(m) ^(x) , C _(y) =g ^(y) h ^(m) ^(y) , C _(xy) =g ^(xy) h ^(m′) ^(xy)

The goal here is to prove C_(xy)=C_(x) ^(y)h^(m) ^(xy) for m_(xy)=m′_(xy)−ym_(y).

-   -   1. Randomize field elements r₁, r₂ and r₃. Ship commitments         R_(y)=g^(r) ¹ h^(r) ³ and R_(xy)=C_(x) ^(r) ¹ h^(r) ² .     -   2. Receive challenge c. In some embodiments, the challenge c can         be received from the verifier or determined via a hash computed         by the prover using the randomized field element values and         randomized input from the verifier.     -   3. Send z₁=cy+r₁, z₂=cm_(xy)+r₂ and z₃=cm_(y)+r₃.     -   4. Verifier checks that g^(z) ¹ h^(z) ³ =C_(y) ^(c)C_(y), C_(y)         ^(z) ¹ h^(z) ² =C_(xy) ^(c)R_(xy).         The proofs of security are trivial and are therefore omitted.

Back to Coordinates From Requirements to Parameters

Relations will now be derived for estimating the number of binary points required to represent each quantity. To this end, one must derive the maximum amount that is to be represented as well as the largest admissible rounding error.

We assume the maximum earth radius to be given. In fact, it's less than 6400 km. We denote it as r_(max). Representation rounding error will be denoted as ε_(r).

The maximum distance in the application and its acceptable estimation error are dl_(max) and ε₁, respectively.

For convenience, we mandate ε_(x)=ε_(y) and dx_(max)=dy_(max).

dl²=dx²+dy². Thus dl is increasing with respect to both dx and dy. Therefore, to obtain boundaries that guarantee dl is within bound, we must plug in dx_(max) and dy_(max). From that we clearly obtain

${dx}_{\max} = {{dy}_{\max} = {\frac{{dl}_{\max}}{\sqrt{2}}.}}$

On the other hand, approximating the errors as first order differentials we have: 2dld²l=2dxd²x+2dyd²y⇔d²l=d²x cos α+d²y sin α for some α. By the same argument as above, with d²l being increasing with respect to d²x and d²y, we can plug in all the maximum values in the equation.

$ɛ_{l} = {{\max \left\{ {{ɛ_{x}\mspace{14mu} \cos \mspace{14mu} \alpha} + {ɛ_{y}\mspace{14mu} \sin \mspace{14mu} \alpha}} \right\}} = {\left. {ɛ_{x}\sqrt{2}}\Rightarrow ɛ_{x} \right. = {ɛ_{y} = {\frac{1}{\sqrt{2}}ɛ_{l}}}}}$

We also get

${d\; \varphi_{\max}} = {{\frac{{dy}_{\max}}{r_{\max}}\mspace{14mu} {and}\mspace{14mu} \theta_{\max}} = {\frac{{dx}_{\max}}{r_{\max}}.}}$

$\mspace{76mu} {{d^{2}y} = {\left. {{{drd}\; \varphi} + {{rd}^{2}\varphi}}\Rightarrow ɛ_{y} \right. = {\left. {{ɛ_{r}d\; \varphi_{\max}} + {r_{\max}ɛ_{\varphi}}}\Rightarrow ɛ_{\varphi} \right. = \frac{ɛ_{y} - {ɛ_{r}d\; \varphi_{\max}}}{r_{\max}}}}}$ ${d^{2}x} = {\left. {{{dr}\mspace{14mu} \cos \mspace{14mu} \varphi_{0}\mspace{14mu} d\; \theta} + {{rd}\mspace{14mu} \cos \mspace{14mu} \varphi_{0}\mspace{14mu} d\; \theta} + {r\mspace{14mu} \cos \mspace{14mu} \varphi_{0}\mspace{14mu} d^{2}\theta}}\Rightarrow ɛ_{x} \right. = {\left. {{ɛ_{r}d\; \theta_{\max}} + {r_{\max}\mspace{14mu} ɛ_{\cos \mspace{14mu} \varphi_{0}}\mspace{14mu} d\; \theta_{\max}} + {r_{\max}ɛ_{\theta}}}\Rightarrow ɛ_{\cos \mspace{14mu} \varphi_{0}} \right. = {{\frac{ɛ_{x} - {ɛ_{r}d\; \theta_{\max}} - {r_{\max}ɛ_{\theta}}}{r_{\max}\mspace{14mu} d\; \theta_{\max}}\mspace{14mu} {and}\mspace{14mu} ɛ_{\theta}} = \frac{ɛ_{x} - {ɛ_{r}d\; \theta_{\max}} - {r_{\max}\mspace{14mu} ɛ_{\cos \mspace{14mu} \varphi_{0}}d\; \theta_{\max}}}{r_{\max}}}}}$

Having been given either ε_(cos ϕ) ₀ or ε_(θ) we can compute the other.

An Instantiation

Plugging r_(max)=6400 km, ε_(r)=1 km, dl_(max)=32 km, ε₁=125 m and ε_(cos φ) ₀ =2⁻¹⁰ into the formulas above yields the following:

TABLE 19 Maximum Point position Bit size dx 22.63 km 4 9 dφ 0.00353554 rad 17 8 dθ 0.00353554 rad 17 8 cosφ₀ 1 10 11

The system described above may be used to enable a prover to convince a verifier that it has a commitment to a point inside a verifier-determined convex polygon. Its applications include proofs of location in cities and gerrymandered areas. In the proof of location applications one may approximate many shapes, even concave ones, as a union of a number of convex shapes.

A point P is inside or on a convex shape A₀ . . . A_(n−1), ordered counter-clockwise if and only if all the angles A_(i)PA_(i+1 mod n) are also counter-clockwise. This is evidenced by that the areas of triangles made by these line-sections always add up to the original shape's area. However, the absolute value of these areas would add up to more than the shape's area if P is outside it. In that case therefore, some of the areas must have conflicting signs.

The signed area of the triangle A_(i)PA_(i+1) is the following:

S(A _(i) PA _(i+1))=½(x _(i) y _(i+1) −x _(i+1) y _(i) +x _(p)(y _(i) −y _(i+1))+y _(p)(x _(i+1) −x _(i)))

The prover only needs to demonstrate that all such areas are positive.

FIG. 15C illustrates, in a flowchart, an example of a method of proving that a first geographic point is within a polygon shape having vertices defining an area 1530, in accordance with some embodiments. In some embodiments, the first geographic point may be associated with a credential location of a user device, and the other geometric point may be associated with the origin of an area of interest defined by the origin and the radius. The method 1530 comprises converting 1532 the first geographic point and geographic points associated with each endpoint of each vertex of the polygon into respective planar approximations, determining 1534 a commitment value of a signed area of each triangle defined by A_(i)PA_(i+1) (where A_(i) and A_(i+1) are the planar approximations of endpoints of a vertex of the polygon shape, P is the planar approximation of the particular geographic location associated with the portable client device, and i is an index value representing a vertex of the polygon), and generating 1536 a proof that the signed area of each triangle defined by A_(i)PA_(i+1) is a positive value. In some embodiments, after the geographic points are converted 1532 into respective planar approximations, a proof portion is generated to prove that dx=r cos φ₀ dθ and dy=rdφ. Other steps may be added to the method 1530, including sending 1538 the commitment values and proof to a verifier. The commitment values and proof allow the verifier to verify that all areas were constructed correctly and proofs determined correctly.

Using Cryptographic Commitments

Before the protocol is executed, the prover and the verifier have agreed on a clockwise ordering of the polygon vertices. The point P, to be proven to be inside the polygon, is given by commitments to its coordinates C_(P) _(x) =g^(P) ^(x) h^(mp) ^(x) ) and C_(P) _(y) =g^(P) ^(y) h^(mp) ^(y) . Because there are no products of two unknown entities, given C_(P) _(x) and C_(P) _(y) the verifier can compute commitments to all 2^(f+1)S(A_(i)PA_(i+1)) where f is the size of the fractional component used, with no input from the prover.

The prover then can show that S(A_(i)PA_(i+1)) can be expressed using f+1+n_(s) bits, where n_(s) is the number of bits used to express the area of the entire shape. The size of the group is to be no less than f+3+n_(s). It should be understood that any other way of proving positivity may be used.

Precision and Parameter Tuning

Error can be defined as the error in estimating the area of a triangle when it is close to zero. This definition is justified by the fact that the only predicate of interest on an area is whether it's positive. This translates to both a completeness and soundness error.

In some embodiments, the error of representing each known coordinate may be denoted as ε_(A), and that of each of P's coordinates denoted as ε_(p). The maximum absolute value of any of A's coordinates may be called |x|_(max) and |y|_(max). The prover initially shows that |x_(p)|≤|x|_(max) and |y_(p)|≤|y|_(max), since there is no guarantee that the following bounds will continue to hold as P's coordinates grow.

Without loss of generality, it may be assumed that |x|_(max)≥|y|_(max). Applying these into the triangle area equation provides

${{2ɛ_{A}} + ɛ_{P}} = {\frac{ɛ_{S}}{2{x}_{\max}}.}$

This is a nice result because it shows that more is to be gained from making the shape coordinates more precise than there is from the unknown point. Relaxing precision requirements on the unknown points will provide efficiency gains.

FIG. 15D illustrates, in a flowchart, an example of a method of proving that a first geographic point is within a union of shapes defining an area 1540, in accordance with some embodiments. In some embodiments, the first geographic point may be associated with a credential location of a user device. Each shape comprising a circle having a radius, or a polygon having vertices, defining an area. The method 1540 comprises converting 1542 the first geographic point into planar approximations, generating 1544 an honest proof for at least one shape that contains the geographic point, and generating 1546 a simulated proof for all other shapes in the union of shapes. Other steps may be added to the method 1540, including sending 1548 the commitment values, honest proof(s) and simulated proof(s) to a verifier. The commitment values and proofs allow the verifier to verify that all areas were constructed correctly and proofs determined correctly.

Choosing the Origin Unknown Point P

An advantage of this choice is that the terms x_(p)(y_(i)−y_(i+1)) and y_(p)(x_(i+1)−x_(i)) are always zero and do not need to be computed. However, x_(i)y_(i+1) and x_(i+1)y_(i) are to be computed as products of two unknown values. This is computationally intensive and is therefore not recommended.

Known Point on or Inside the Shape

Possible choices include one of the vertices, min and max averages of the coordinates and the mean of the vertices. In one embodiment the min and max averages are selected, since in that case, the term |x|_(max) would be minimized, allowing for larger errors ε_(A) and ε_(p).

It is understood that the above concepts of proving that a commitment is within a distance from a point (i.e., within a circle), or within a union of convex polygons (i.e., within a gerrymandered shape) may be applied to other shapes, including a union of one or more circles and one or more polygons.

Simulation of Location-Based Zero-Knowledge Proofs

A simulation of a cryptographic protocol is the process of generating a transcript that is indistinguishable from an honestly generated one, but is generated by the same party. Theoretically, the concept is useful in proofs of security. In practice, it is used to prove disjunctions of statements by allowing the prover to “cheat” on all statements but one of their choosing.

All steps of a simulated statement are simulated with the same challenge. Location-related protocols described herein comprise the following steps which would be simulated as follows:

Multiplication by a Known Factor

To simulate a “multiplication by a known” proof, recall that an honest proof of b=ca involves proving that C_(b)=g^(b)h^(r) ^(b) encodes the same entity as Ca. Then the proof that establishes that equality must be simulated. Simulating equality proofs is described infra.

Squaring a Commitment

The following simulator can make it look like a²=0 regardless of a's value.

Given the challenge c, and a commitment C_(a)=g^(a)h^(m), the simulator generates a commitment to a² for an arbitrary value for a² by performing the following:

-   -   1. Randomize z₁, z₂, z₃, m′     -   2. Compute the commitment C_(a) _(z) =g^(a) ^(z) h^(m′)     -   3. Compute R₁=g^(z) ¹ h^(z) ² C_(x) ^(−c) and R₂=C_(x) ^(z) ¹         C_(a) ₂ ^(−c)h^(z) ³ .     -   4. Ship z₁, z₂, z₃, C_(a) ₂ , R₁, R₂ to the verifier.

Step 3 can be optimized by taking a²=0 so that R₂=C_(x) ^(z) ¹ h^(−cm′+z) ³ .

Decomposing a Commitment

The following simulation process can generate false bit decompositions:

When decomposing C_(a)=g^(a)h^(m) into n digits, all the commitments for C_(i)=g^(a) ^(i) h^(m) ^(i) for i≠0 are to the value a; and the least significant bit commitment is C₀=g^(a) ⁰ h^(m) ⁰ where m₀=m−Σ_(i=1)m_(i) ⁽² ^(i) ⁾, a₀=a−Σ_(i=1)a_(i) ⁽² ^(i) ⁾, a_(i) are arbitrary for i≠0 and m_(i) are random for i≠0. The proof of well-formedness for all bits are simulated. Recall that a proof of well-formedness for a bit commitment C_(i)=g^(a) ^(i) h^(m) ^(i) was a disjunction of the statements a_(i)=0 and a_(i)=1. In this case, given the challenge c, the simulator randomizes the challenge c′ and feeds the sub-simulators the sub-challenges c′ and c−c′.

The process can be optimized by taking a_(i)=0 for i≠0 and a_(i)=a.

Application to Location-Based Proofs

In order to simulate position in a circle of radius r, the simulator can

-   -   1. Generate commitments to dx,dy and simulate proofs that dx=r         cos φ₀dθ and dy=rdφ.     -   2. Generate commitments to dx², dy² and simulate proofs that         they were correctly computed.     -   3. Generate commitment to δ=r²−dx²−dy² (simply through group         arithmetic)     -   4. Simulate decomposition of δ to show it's a positive signed         number.

FIG. 15E illustrates, in a flowchart, a method of simulating a proof that a particular geographic location is within an area defined by an origin and a radius 1550, in accordance with some embodiments. The method 1550 comprises generating 1552 commitments to planar approximations dx and dy of the particular geographic location, generating 1554 a first simulated proof portion that dx=r cos φ₀dθ and dy=rdφ, generating 1556 commitments to squared planar approximations dx² and dy² of the particular geographic location, generating 1558 a second simulated proof portion that dx² and dy² were correctly computed, and generating 1660 a commitment to δ=r² dx²−dy²; and generate 1662 a third simulated proof that a decomposition of δ is a positive value. Other steps may be added to the method 1550.

The following can simulate a proof of being contained in a polygon:

-   -   1. Generate commitments to dx,dy and simulate proofs that dx=r         cos φ₀dθ and dy=rdφ.     -   2. Generate commitments to values S(A_(i)PA_(i+1)) through         multiplication proof simulations and group arithmetic and         simulate proofs that they were formed correctly.     -   3. Generate simulated proofs that all the S(A_(i)PA_(i+1)) are         positive.

FIG. 15F illustrates, in a flowchart, a method of simulating a proof that a particular geographic location is within an area defined by a polygon shape having vertices 1570, in accordance with some embodiments. The method 1570 comprises generating 1572 commitments to planar approximations dx and dy of the particular geographic location, generating 1574 a first simulated proof portion that dx=r cos φ₀dθ and dy=rdφ, generating 1576 commitments to signed values S(A_(i)PA_(i+1)), generating 1578 a second simulated proof portion that the signed values were formed correctly, and generating 1580 simulated proof portions that all the signed values S(A_(i)PA_(i+1)) are positive values. Other steps may be added to the method 1570.

Sharing of Values

In some embodiments, where the shapes in question are geographically close, the same planar approximation may be valid for all shapes defining areas that are geographically close. In this case, step 1 can be performed once for all of the shapes with an honest proof and the same committed values for dx and dy can be used for each shape.

SafeShare Application

FIGS. 16-21 are screenshots of an example web application illustrating a sample prover computing device user experience, according to some embodiments. In this example, a token is a signed token from a semi-honest issuer attesting to its carrier's having a certain attribute, and an attribute is any logically simple claim one can make about oneself.

FIG. 16 is a screenshot of an example credential manager, according to some embodiments. FIG. 17 is a screenshot of an example credential manager having an expanded portion to view additional details of the credential, according to some embodiments.

FIG. 18 is a screenshot of an example credential manager showing an expanded credential view of a single credential, according to some embodiments.

FIG. 19 is a screenshot of an example page requiring verification, according to some embodiments.

In this example, the prover has navigated to a page for a skydiving program whereby the user must prove that they are at least 18 years of age, and that they have been recently declared healthy. There is also a student deal, where if the prover wishes to access the student deal, they must also prove that they are currently enrolled at a university. It is understood that other criteria may be included, such as location or residency within a certain geographic area.

FIG. 20 is a screenshot of an example proof request interface page, according to some embodiments. The verifier (e.g., a vendor) sends a proof request, and the user is redirected to the user interface. The proof request is written in a formal language; therefore, the natural language description also comes from the vendor. The user has the option to view the proof request code and vote on whether it matched the natural language description. It is understood that other criteria may be included, such as location or residency within a certain geographic area.

FIG. 21 is a screenshot of an example proof input interface page, according to some embodiments. After agreeing to the policy, the interface includes visual elements that the prover may select to choose which of their credentials to use as input to the proof generation algorithm. These credentials will not be shared with the verifier, but it will be proven in zero knowledge that they satisfy the policy.

Glossary

Issuer/Identity Provider is a party trusted by the prover and the verifier, that attests to the prover's attributes.

Prover/Client the party in contact with the issuer as well as the verifier, attempting to prove properties in zero knowledge.

Verifier the party demanding knowledge of certain properties about the prover.

Attribute a proposition about the prover to which the issuer attests.

Property a proposition about the prover whose truth the verifier wants to ascertain. It may be identical to one of the prover's attributes or logically implied by one or many of them.

Proof Request a formalized message from the verifier specifying the property of which it demands knowledge, containing additional information about the protocols supported, etc.

Proof a message from the client to the verifier, providing cryptographic assurance as to the issuer's attestation to the client's satisfaction of the property specified in the proof request.

Templates for Messages

The protocols message can be communicated as JSON-encoded.

Proof Request

What follows is a sample proof request.

{ “proof_request”:{ “lang”:“straight-talk-1.0”, “url”:“https://bank.com/straight-talk/sample-scripts/alcohol-consumption.stk”, “verifier_args”:{ “expiration_threshold”:{ “genesis”:“01/01/2018”, “apocalypse”:“01/01/2100”, “granularity”:“day”, “since_genesis”:1000, }, “birth_threshold”:{ “genesis”:“01/1900”, “apocalypse”:“01/1998”, “granularity”:“day”, “till_apocalypse”:195 } }, “permitted_issuers”:[“Bank”,“Florida DMV”], “supported_schemes”:[ {“scheme”:“u-prove”,“dlog_params”:{“group”:“prime256v1”,“generators”:“base64 hash of generators, or list of generators”}}, { “scheme”:“delegated-verification”, “remote_attestation”:{“offline_accepted”:true, “later_than”:“01/01/2017”} } ], “ca_certs”:[{“name”:“bank-identity-brokerage-ca”,“digest”:“base64 sha2”}], “challenge_string”:“base64 byte string” } } The script “alcohol-consumption.stk” can contain the following:

verifier params { date_t expiration_threshold; date_t birth_threshold; }; credential{ date_t expiration_date; date_t birth_date; }; return expiration_date >expiration_threshold && birth_date <birth_threshold;

Instead of providing a URL, the verifier can provide the source code or bytecode to a straight talk script.

A standard bytecode language for straight talk shall also be provided.

Proof

The following can be a response to the request above:

{ “proof”:{ “scheme”:“u-prove-1.0”, “dlog_params”:{“group”:“prime256v1”,“generators”:“base64 hash”}, “credential_metadata”:{ “issuer”:{“name”:“BANK”,“cert”:“bash64 cert”}, “attribute_indexes”:{ “expiration_date”:0, “birth_date”:1 }, “attribute_count”:5 }, “presentation_proof”:{ “configuration”:“cchhh”, “uprove stuff”:“things” }, “standalone_comparison_proof”:{ “lhs”:“expiration_date”, “relation”:“greater”, “rhs”:“06/20/1997”, “relation_commitment_mask”:“base64 bignum”, “decomposition”: { “commitment_in”:“lhs”, “bits_little_endian”:[ {“commitment”:“base64 group element”, “well-formedness”:“....”}, {“commitment”:“base64 group element”, “well-formedness”:“...”} ] }, “comparison”: { “in”:“lhs”, “bit_comparisons”:[ { } ] } }, “request_digest”:“base64 hash” } }

Another example proof, based on secure enclaves, is provided below:

{ “proof”:{ “scheme”:“delegated-verification”, “remote_attestation_transcript”:{ “base_randomness”:“base64 byte array”, “msg1”:{ }, “msg2”:{ }, “msg3”:“”, “ias_signature”:“” }, “request_digest”:“base64 hash”, “verifier_public_key”:“pem encoding”, “validation_signature”:“base64 signature” } }

FIG. 22 is a schematic diagram of a computing device 2000 such as a server. As depicted, the computing device includes at least one processor 2002, memory 20020, at least one I/O interface 2006, and at least one network interface 2008.

Processor 2002 may be an Intel or AMD x86 or x64, PowerPC, ARM processor, or the like. Memory 2004 may include a combination of computer memory that is located either internally or externally such as, for example, random-access memory (RAM), read-only memory (ROM), compact disc read-only memory (CDROM).

Each I/O interface 2006 enables computing device 2000 to interconnect with one or more input devices, such as a keyboard, mouse, camera, touch screen and a microphone, or with one or more output devices such as a display screen and a speaker.

Each network interface 2008 enables computing device 2000 to communicate with other components, to exchange data with other components, to access and connect to network resources, to serve applications, and perform other computing applications by connecting to a network (or multiple networks) capable of carrying data including the Internet, Ethernet, plain old telephone service (POTS) line, public switch telephone network (PSTN), integrated services digital network (ISDN), digital subscriber line (DSL), coaxial cable, fiber optics, satellite, mobile, wireless (e.g. WMAX), SS7 signaling network, fixed line, local area network, wide area network, and others.

Computing device 2000 is operable to register and authenticate users (using a login, unique identifier, and password for example) prior to providing access to applications, a local network, network resources, other networks and network security devices. Computing devices 2000 may serve one user or multiple users.

FIG. 23 is a server for inclusion in a data center, according to some embodiments. The server is an illustration of a special purpose machine 2102, according to some embodiments that may reside at data center. The special purpose machine 2102, for example, incorporates the features of the verification system and is provided in a portable computing mechanism that, for example, may be placed into a data center as a rack server or rack server component that interoperates and interconnects with other devices, for example, across a network or a message bus. For example, the server may be configured to provide one or more secure data storage spaces, or may include one or more secure enclave processors, among others.

FIG. 24 is a system diagram for an example verification system, according to some embodiments.

There may be multiple issuer entities, each having their own set of associated computing devices (e.g., computers in data centers). The issuer entities and their computing devices may have heterogeneous data storage mechanisms, which can include local storage and/or specially allocated memory storages, including secured enclave memory and/or processors.

As illustrated in the example of FIG. 24, issuer devices 2202 are coupled to a client secured data storage. The issuer device 2204 may be coupled to a blockchain data structure backend or a distributed ledger mechanism that can be accessed and/or otherwise interacted with (e.g., pushing new information to be stored on the blockchain, querying the blockchain using a blockchain explorer), among others.

The blockchain data structure, in some embodiments, is a public blockchain (e.g., publicly accessible, such as an Ethereum blockchain), or a private, permissioned blockchain that operates through a propagated distributed ledger shared across a set of trusted nodes. The blockchain data structure may store immutable attributes (and/or encrypted or signed versions of the attributes).

Multiple authoritative issuer devices 2202, 2204 are configured to provide signed attributes which may either be delivered to the client special space 2206 (e.g., a secured enclave having secured memory and/or secured processors) or onto the blockchain data structure 2208. These attributes represent aspects of client personal information. The client special space 2206 can store some signed attributes and the proof response logic, and can be stored in a data storage remote from the on-board memory of devices associated with the client. A benefit of having a client special space 2206 is that, for example, multiple client devices 2210 are able to connect to the client special space 2206 (e.g., a tablet, a mobile device, a desktop computer), and if a client loses a device, the signed attributes remain accessible.

The blockchain data structure 2208 is adapted to store on one or more distributed ledgers, data blocks representing signed attributes and the proof response logic, according to some embodiments. Similarly, multiple client devices 2210 are able to connect to the blockchain data structure 2208 (e.g., a tablet, a mobile device, a desktop computer), and if a client loses a device 2210, the signed attributes remain accessible.

Proof requests and responses can be conducted using, for example, connected electronic client devices 2210 (e.g., a mobile device, such as a smartphone or a tablet) or other devices that are connected to the mobile device using Bluetooth low energy (e.g., a wearable device). The client devices 2210 may store locally a public key which can be utilized to encrypt data messages for decryption using the corresponding secret key or validate signed attributes that are signed based on the corresponding secret key.

FIG. 25 is a system diagram depicting a method for registration, according to some embodiments.

At step 1 (shown by the encircled numbers in FIG. 25), a data communication occurs between the client device to the client special space data storage, whereby the client device generates control messages that authenticates and establishes the special space data storage, which, in an example, is a SGX Secure Enclave or other hardware protected space.

A public/private key pair is generated, and the client device retains the public key (Pk) in data storage, while the private/secret key (Sk) is stored on the client special space data storage.

At step 2, a data communication occurs between the client device to the issuer device. The client authenticates (e.g., 2 way authentication) in relation to the issuer device, selecting which attributes he/she wants to provide (e.g., Age, zip, over 21, etc.) from a set of offered selections. In some embodiments, the issuer device may provide one or more interface options indicative of potential token destinations (e.g., storage destinations), including the client special space data storage or a blockchain-based data storage, such as a permissioned blockchain or a public blockchain.

The issuer is configured to then deliver attributes, for example, in a client secret space data structure, the client's device can provide a pointer (e.g., a uniform resource locator address (URL)) to a special space data structure, and can transmit the public key (Pk) to the issuer device. Attributes are then created by the issuer device using a combination of the client's public key and the issuer's secret key (Sk), which can be delivered for storage on the client secret space data structure (3A) or on a data block of a blockchain. Where the attribute is stored on the blockchain, the attribute may be made public (if the issuer is blockchain enabled), and thus publicly viewable. The public blockchain may be configured to store a pre-defined set of attribute types that are thus publically viewable (e.g., using a blockchain explorer).

In another embodiment, where the issuer device is capable of interacting with the blockchain and the attribute can be made public (e.g., over 21), the issuer device delivers attributes signed by the issuer using the client's public key (Pk) to the blockchain (3B).

In another embodiment, where the issuer device is capable of interacting with the blockchain and the attribute requires the client's permission (e.g., date of birth), the issuer can store on the blockchain signed attributes that are encrypted with the client's public key (3C).

In an alternate embodiment, a sidechain is utilized to keep attestation private between the involved parties.

FIG. 26 is a system diagram depicting a method for verification, according to some embodiments.

Sample steps for verification are described herein, whereby the client device forms a communication channel with the authenticated verifier, and the verifier makes a “Proof Request”.

The proof request can be provided, for example, to the client secret space data storage. At step 3A, a “Proof Request” is sent to the Client's special space data storage, where a bounded device has both the URL and public key to access the special space. At step 4A, a “Proof Response” is sent back to the client device.

In an alternate embodiment where the issuer device is blockchain-enabled and the attribute can be made public (e.g., that the user is over 21), at step 3B, data messages representing the “Proof Request” are transmitted to the blockchain (or a blockchain explorer tool configured to interact with the blockchain), and at step 4B, a data message representing the “Proof Response” is sent back to the device as the attribute is public. In an alternate embodiment, the client device can direct the verifier to the blockchain, for example by providing a link or a block number indicative of where the attribute is stored.

In another embodiment, the issuer is blockchain-enabled and but the attribute needs client's permission (e.g., date of birth, address). In this example, at step 3C, a “Proof Request” is sent to the blockchain (e.g., or to a blockchain explorer tool configured to interact with the blockchain), and at step 4C, an “Encrypted Proof Response” is sent back to the device.

The client device may then be required to grant permission to share the attribute at step 5C, and responsive to permission being granted, at step 6C, the “Encrypted Proof Request” is then transmitted to the client special space data storage for decryption. At step 7C, a Decrypted Proof Response is sent back to the client device that could then be provided to the verifier device.

FIG. 27 is a system diagram depicting an example age verifier device 2502, according to some embodiments.

A device is positioned at a point of sale or other location where verification is required, such as in front of a bar serving alcohol. The verification can be used as a gatekeeper mechanism in some cases, or in other cases, as a tool to determine whether a particular individual is entitled to various statuses or discounts (e.g., student discount, or located within a geographic location, etc.). The device 2502 is adapted, in a specific, illustrative example, in relation to a requirement to check the age of all customers.

Without such a system, a cashier would have to request an identification card (which could be falsified), and perform mental math to determine if the individual is over 19 years old. This is time consuming; and requires mental work effort. Furthermore, the customer may find the check to be invasive, as the relationship between cashier and customer is unknown.

The device 2502 can be a terminal set up at the point of sale, for example, which could be designated a verifier computing device. The device 2502, in an example embodiment, may be configured to render a visual representation 2504 of a resource locator, such as a quick response code. The quick response code can be related to an underlying data element, such as a URL, which the client device can interact with, for example, by scanning the code to access the URL. On the backend, verification processes as described in various embodiments herein are utilized to transmit or otherwise make available signed attribute information of the client device, which are then provided to the verification device 2502 such that verification device 2502 is able to verify specific attributes of the client (e.g., age >25, or address is within a geographic location, etc.). The verification device 2502 can be configured to modify a rendering 2506 to visually or audibly indicate that the client has successfully passed or failed the attribute test.

In some embodiments, one or more aspects of the blockchain, tokenization and/or verification/validation/proof processes described herein can involve one or more secure execution environments and/or secure storage elements. For example, in some embodiments, the storage of private keys and tokens, in addition to computations required for issuance and proofs, could be performed on Trusted Execution Environments, Smart Cards, Secure Elements or Trusted Platform Modules on devices such as mobile and personal computers using corresponding APIs.

In some embodiments, a computing system includes or is configured to provide a plurality of distinct execution environments. The isolation of these environments can be enforced using software or hardware. In some embodiments, a distinct execution environment can include one or more secure storage elements (for example, a Secure Element or one or more aspects of a Smart Card).

The distinct execution environments are, in some embodiments, configured to provide access to different storage and processing resources.

In some embodiments, one of the environments may be referred to as a trusted execution environment (TEE) and may have access to isolated and secure storage and processing resources.

In some embodiments, a secure environment may support a distinct operating system, or it may be a set of secure resources accessible to applications that are assigned to use it by the underlying operating system of the overall system. In some embodiments, a computing system includes a dedicated secure storage resource, such as a separate secure storage or a secure storage area within a general storage resource. In some embodiments, the computing system includes a dedicated secure memory device such as a separate secure memory, or a secure area within a general memory resource (e.g., secure memory may be accessible in a different address space or in a different address range).

These resources may be physically and/or logically distinct from the general resources of the same type. In a computing system that includes or is configured to provide two distinct execution environments, the first execution environment is a secure execution environment and the second execution environment is a potentially unsecure environment.

The secure execution environment is sometimes referred to as a trusted execution environment (TEE) and the potentially unsecure environment is sometimes referred to as a rich execution environment (REE).

The second execution environment (e.g., the potentially unsecure execution environment) is configured to communicate with the secure execution environment (e.g., the first execution environment) to request one or more aspects of the tokenization and/or verification/validation process to be performed.

The second execution environment includes an unsecure portion of a processor, memory, and storage. Software code of the second execution environment can include an unsecure OS which is stored in storage, loaded into memory at run time, and executed by processor to perform OS operations. In some embodiments, software executable by the second execution environment can include one or more APIs or other software components for providing function calls or otherwise interfacing with one or more components of the first execution environment.

For example, in some embodiments, the first (e.g., secure) execution environment can include (e.g., store) one or more keys such as root keys, private keys, and the like for generating signs tokens, validating one or more signed data elements, and/or the like. Some environment, first execution environment can include (e.g., store) one or more tokens against which one or more credentials or other data elements can be validated.

In some embodiments, first execution environment can include one or more software components including computer executable code for generating/issuing and/or validating one or more tokens, credentials and/or other data elements.

For example, in one example embodiment, a digitally signed token representing a verified identity or account can be stored in a secure storage element in a secure execution environment. A secure execution environment can include computer executable instructions which receive from an unsecure execution environment one or more data sets representing one or more biometric verification credentials.

The computer executable instructions and the secure execution environment can be configured to perform one or more calculations or data transformations to validate that the data sets representing the biometric verification credentials match or otherwise correspond to the digitally signed token as described herein or otherwise. In some embodiments, the data sets representing the one or more biometric verification credentials can be received at the device on which the secure execution environment resides and/or an external device in communication with the device in which the secure execution environment resides.

In some embodiments, secure execution environment can return one or more signals indicating whether the biometric verification credentials are valid or otherwise match the digitally signed token. Some environments, the signals can include one or more signed data elements to confirm the veracity of the signals.

In some embodiments, the secure execution environment can be configured to respond to proof requests from unsecure execution environment(s).

In some embodiments, a secure execution environment can be used to generate a signed token. In some embodiments, a secure execution environment can receive from an unsecure execution environment one or more tokens and/or credentials. One or more software elements within the secure execution environment can generate a signed token and/or credential using one or more private keys stored within the secure execution environment. The signed token and/or credential can then be returned to the unsecure execution environment.

In some embodiments, one or more aspects of the blockchain verification, transaction and/or other modification processes can be performed within a secure execution environment to ensure that private keys, addresses, credentials and/or the like are only accessible by authorized users and/or processes within the secured environment.

Any other aspect of the tokenization and/or her validation process can be similarly applied to using these secure an unsecure execution environment to ensure that sensitive information such as keys, credentials, tokens, tokenization algorithms, biometric data, biometric processing algorithms, blockchain transactions/activities, neural networks, and/or the like are only accessible by authorized users and/or processes.

In some embodiments, sensitive operations using a private key may be performed only in a secure area. In some embodiments, all or additional operations may be performed in a java card space of a smart card.

Applicant notes that the described embodiments and examples are illustrative and non-limiting. Practical implementation of the features may incorporate a combination of some or all of the aspects, and features described herein should not be taken as indications of future or existing product plans. Applicant partakes in both foundational and applied research, and in some cases, the features described are developed on an exploratory basis.

Example Commitment Non-zeroness protocol

Consider a dummy example where the group is of order 23. The prover has a commitment C_(x)=g¹³h¹² (x=13, y=12) and wants to prove that it is nonzero.

The prover first privately computes t₁=x⁻¹

16 and t₂=−yx⁻¹

15. Note that g=C_(x) ^(t) ¹ h^(t) ² .

The prover first samples two random numbers, say r₁=6 and r₂=21. It computes R=C_(x) ⁶h²¹=g⁹h and hashes C_(x) and R together to obtain c, say its value is c=7. The prover computes z₁=ct₁+r₁=3 and z₂=ct₂+r₂=11 and sends over C_(x), R, z₁ and z₂.

The verifier independently computes c and checks that g^(c)R=C_(x) ^(z) ¹ h^(z) ² =_(g) ¹⁶h which is indeed true.

It can be seen that the prover was required to perform one modular inverse, two randomizations, two group exponentiations and one group multiplication. The method of Belenkiy requires 4 randomizations, 3 group multiplications and 7 group exponentiations.

Data Example, Real World Setting:

Here is an example run of the protocol in a real-world setting. The NIST-recommended SECP256r1 curve has been used as the discrete log group with g being the default generator.

Integers:

x=98928670389352510396523151697355904354792004957973774412595633303273732497743

y=95008053600361093431923046575424751433609377135357996941110581993938165236367

x⁻¹=46269840326567351854099451051133827535525340183367300921621852037000846966515

−yx⁻¹=81188361761744559520267578766075689915069017610794183025696816908727773241705

r₁=64174188764800913824267254049454250383880323837574216579480449677278287845053

r₂=78072047693972697562257276623750159877182993380025344884890619716596569262161

c=96224990109810121210565620440984233367486068200169166402592191291511631801053

z₁=77558756204012200080475684884310387291370943910107311585466358661683 524082068

z₂=10967924588729828517744024474218426311078559706343058313692421336800 4095632307

Note: The specific value of c depends on how hashing is carried out. Many possible ways of doing so can be valid. The process involves deterministically serializing the objects to be hashed (however seen fit) and pass the resulting byte array through a secure hash (in this example, SHA256).

Note: These integers are displayed in base 10.

Group Elements:

C_(x)=(e6ab3db4c6691dda4a8b05d79a15559c18181cda6c6dfc7fc77f41dff392e41,f0d8a7a 52e882ff9da9f64cf082db98bbe1db6fa6f965dc96a4150b95270e073,1da350a2e431d51de9217a 218313fb2cc39f8f1dda48ea33ad7b1e561ef00e89)

h=(e6ab3db4c6691dda4a8b05d79a15559c18181cda6c6dfc7fc77f41dff392e41,f0d8a7a5 2e882ff9da9f64cf082db98bbe1db6fa6f965dc96a4150b95270e073,1da350a2e431d51de9217a2 18313fb2cc39f8f1dda48ea33ad7b1e561ef00e89)

R=(b5e8e60e25842deb89cdb80047e49681b566b8bcf6b6fd6298fdc7dab5857300,54cac d179ab2e3fbc892b1001c47408dc1d8559c8a2dce519094ab874b640e87,11b5ec881901a0901d 73d0892402c3f70d96f6d23ca851cd7fe9402f886f6bb4)

Note: These group elements are displayed in projective coordinates base 16.

Example Comparison Protocol

Consider G to be a discrete log group of prime order p and g and h be generators with unknown discrete logs. (Setting identical to that of all the rest of the protocols).

Let numbers q and 1 be such that

${q - 1} = {2^{N} \leq \frac{p}{2}}$

and two whole numbers a and b such that 1≤a≤b<q.

Consider commitments A=g^(a)h^(m) ^(a) and B=_(g) ^(b)h^(m) ^(b) to a and b, respectively.

To prove that a b, the following steps can be taken:

-   -   1. Prover computes C=BA⁻¹=g^(b−a)h^(m) ^(b) ^(−m) ^(a)         =g^(c)h^(m) ^(c) .     -   2. Prover produces bit commitments A_(i)=g^(a) ^(i) h^(m) ^(ai)         , B_(i)=g^(b) ^(i) h^(m) ^(bi) , C_(i)=g^(c) ^(i) h^(m) ^(ci)         for i∈{1, . . . , N−1} where a_(i), b_(i) and c_(i) are the i'th         bits of a−1, b−1 and c, respectively. M_(ai), M_(bi) and m_(ci)         are sampled randomly.     -   3. Prover computes A₀=g^(a) ⁰ h^(m) ^(a0) =AΠ_(i=1) ^(N−1)A_(i)         ⁻² ^(i) and likewise B₀=g^(b) ⁰ h^(m) ^(b0) =BΠ_(i=1)         ^(N−1)B_(i) ⁻² ^(i) and C₀=g^(c) ⁰ h^(m) ^(c0) =CΠ_(i=1)         ^(N−1)C_(i) ⁻² ^(i) .     -   4. For each i∈{0, 1, . . . , N−1}, the prover does the         following:         -   a. Randomly sample r_(ai), d′_(ai) and z′_(ai).         -   b. Compute R_(ai,a) _(i) =h^(r) ^(ai) and R_(ai,(1−a) _(i)             ₎=h^(z′) ^(ai) (A_(i)g^(−a) ^(i) )^(−d′) ^(ai) .         -   c. Compute d_(ai)=H(A_(i),R_(ai,0), R_(ai,1))         -   d. Compute z_(ai)=(d_(ai)−d′_(ai))m_(ai)+r_(ai)         -   e. Assign z_(ai,ai)=z_(ai), z_(ai,(1−a) _(i) ₎=z′_(ai),             d″_(ai,a) _(i) =d_(ai)−d′_(ai) and d″_(ai,(1−a) _(i)             ₎=d′_(ai)         -   f. Repeat steps a through e for B and C     -   5. Prover sends all A_(i), R_(ai,0), R_(ai,1) d′_(ai,0),         z_(ai,0), z_(ai,1), B_(i), R_(bi,0), R_(bi,1), d′_(bi,0),         z_(bi,0), z_(bi,1), C_(i), R_(ci,0), R_(ci,1), d″_(ci,0),         z_(ci,0), z_(ci,1).     -   6. Verifier checks that A=Π_(i=0) ^(N−1)A_(i) ² ^(i) , B=Π_(i=0)         ^(N−1)B_(i) ² ^(i) , BA⁻¹=Π_(i=0) ^(N−1)C_(i) ² ^(i) .     -   7. For each i∈{0, 1, . . . , N−1} the verifier checks that:         -   a. A^(d″) ^(ai,0) R_(ai,0)=h^(z) ^(ai,0)         -   b. (Ag⁻¹)^(H(A) ^(i) ^(,R) ^(ai,0) ^(,R) ^(ai,1) ^()−d″)             ^(ai,0) R_(ai,1)=h^(z) ^(ai,1)         -   c. Check the same conditions for B and C

Note: It may be that either a or b are known to the verifier. In such a case there is no need to decompose the known number and commitment C will have the same mask exponent as that of the unknown parameter.

Note: In an embodiment, the prover avoids sending A₀, B₀ and C₀ to reduce the size of its messages. In that case, in step 6, instead of verifying a relation between the bit commitments the verifier derives A₀, B₀ and C₀ independently.

Dummy Example

Let p=23, l=0, q=8, a=3, b=5, A=g³h⁶, B=g⁵h¹.

-   -   1. Prover computes C=g²h¹⁸     -   2. Prover generates commitments A₁=gh¹⁷, A₂=h²², B₁=h³, B₂=gh⁴,         C₁=gh² and C₂=h¹⁷.     -   3. Prover computes commitments A₀=gh²², B₀=gh² and C₀=h¹⁵.     -   4. Prover does the following:         -   a. Randomly sample r_(a0)=15, d′_(a0)=10, z′_(a0)=18,             r_(a1)=3, d′_(a1)=5, z′_(a1)=7, r_(a2)=3, d′_(a2)=18,             z′_(a2)=4, r_(b0)=17, d′_(b0)=19, z′_(b0)=7, r_(b1)=8,             d′_(b1)=12, z′_(b1)=6, r_(b2)=7, d′_(b2)=5, z′_(b2)=3,             r_(c0)=11, d′_(c0)=21, z′_(c0)=19, r_(c1)=5, d′_(c1)=16,             z′_(c1)=12, r_(c2)=9, d′_(c2)=5, z′_(c2)=10.         -   b. Compute R_(a0,0)=h¹⁸A₀ ⁻¹⁰=g¹³h⁵, R_(a0,1)=h¹⁵,             R_(a1,0)=h⁷A₁ ⁻⁵=g¹⁸h¹⁴, R_(a1,1)=h³, R_(a2,0)=h³,             R_(a2,1)=h⁴(A₂g⁻¹)⁻¹⁸=g¹⁸h²², R_(b0,0)=h⁷B₀ ⁻¹⁹=g⁴h¹⁵,             R_(b0,1)=h¹⁷, R_(b1,0)=h⁸, R_(b1,1)=h⁶(B₁g⁻¹)⁻¹²=g¹²h¹⁶,             R_(b2,0)=h³(B₂g⁻¹)⁻⁵=g⁵h⁶, R_(b2,1)=h⁷, R_(c0,0)=h¹¹,             R_(c0,1)=h¹⁹(C₀g⁻¹)⁻²¹=g²¹h³, R_(c1,0)=h¹²C₁ ⁻¹⁶=g⁷h³,             R_(c1,1)=h⁵, R_(c2,0)=h⁹, R_(c2,1)=h¹⁰(C₂g⁻¹)⁻⁵=g⁵h¹⁷.         -   c. Compute hashes, say d_(a0)=17, d_(a1)=4, d_(a2)=17,             d_(b0)=12, d_(b1)=20, d_(b2)=3, d_(c0)=7, d_(c1)=1,             d_(c2)=0.         -   d. Compute responses z_(a0)=(17−10)22+15=8,             z_(a1)=(4−5)17+3=9, z_(a2)=(17−18)22+3=4,             z_(b0)=(12−19)2+17=3, z_(b1)=(20−12)3+8=1,             z_(b2)=(3−5)4+7=22, z_(c0)=(7−21)15+11=8,             z_(c1)=(1−16)2+5=21, z_(c2)=−5×17+9=16.         -   e. Assign values z_(a0,0)=18, z_(a0,1)=8, z_(a1,0)=7,             z_(a1,1)=9, z_(a2,0)=4, z_(a2,1)=4, z_(b0,0)=7, z_(b0,1)=3,             z_(b1,0)=1, z_(b1,1)=6, z_(b2,0)=3, z_(b2,1)=22, z_(c0,0)=8,             z_(c0,1)=19, z_(c1,0)=12, z_(c1,1)=21, z_(c2,0)=16,             z_(c2,1)=10.     -   5. Prover sends A₀=gh²², R_(a0,0)=g¹³h⁵, R_(a0,1)=h¹⁵,         d′_(a0,0)=10, z_(a0,0)=18, z_(a0,1)=8, A₁=gh¹⁷, R_(a1,0)=g¹⁸h¹⁴,         R_(a1,1)=h³, d″_(a1,0)=5, z_(a1,0)=7, z_(a1,1)=9, A₂=h²²,         R_(a2,0)=h³, R_(a2,1)=g¹⁸h²², d′_(s2,0)=22, z_(a2,0)=4,         z_(a2,1)=4, B₀=gh², R_(b0,0)=g⁴h¹⁵, R_(b0,1)=h¹⁷, d′_(b0,0)=19,         z_(b0,0)=7, z_(b0,1)=3, B₁=h³, B_(b1,0)=h⁸, R_(b1,1)=g¹²h¹⁶,         d″_(b1,0)=8, z_(b1,0)=1, z_(b1,1)=6, B₂=gh⁴, B_(b2,0)=g⁵h⁶,         R_(b2,1)=h⁷, d′_(b2,0)=5, z_(b2,0)=3, z_(b2,1)=22, C₀=h¹⁵,         R_(c0,0)=h¹¹, R_(c0,1)=g²¹h³, d″_(c0,0)=9, z_(c0,0)=8,         z_(c0,1)=19, C₁=gh², R_(c1,0)=g⁷h³, R_(c1,1)=h⁵, d″_(c1,0)=16,         z_(c1,0)=12, z_(c1,1)=21, C₂=h¹⁷, R_(c2,0)=h⁹, R_(c2,1)=g⁵h¹⁷,         d″_(c2,0)=18, z_(c2,0)=16, z_(c2,1)=10 to the verifier.     -   6. The verification steps are omitted in this description of         this example.

The discussion provides example embodiments of the inventive subject matter. Although each embodiment represents a single combination of inventive elements, the inventive subject matter is considered to include all possible combinations of the disclosed elements. Thus, if one embodiment comprises elements A, B, and C, and a second embodiment comprises elements B and D, then the inventive subject matter is also considered to include other remaining combinations of A, B, C, or D, even if not explicitly disclosed.

Throughout the foregoing discussion, references were made regarding servers, services, interfaces, portals, platforms, or other systems formed from computing devices. It should be appreciated that the use of such terms is deemed to represent one or more computing devices having at least one processor configured to execute software instructions stored on a computer readable tangible, non-transitory medium. For example, a server can include one or more computers operating as a web server, database server, or other type of computer server in a manner to fulfill described roles, responsibilities, or functions.

The terms “connected” or “coupled to” may include both direct coupling (in which two elements that are coupled to each other contact each other) and indirect coupling (in which at least one additional element is located between the two elements).

The technical solution of embodiments may be in the form of a software product. The software product may be stored in a non-volatile or non-transitory storage medium, which can be a compact disk read-only memory (CD-ROM), a USB flash disk, or a removable hard disk. The software product includes a number of instructions that enable a computer device (personal computer, server, or network device) to execute the methods provided by the embodiments.

The embodiments described herein may be implemented by physical computer hardware, including computing devices, servers, receivers, transmitters, processors, memory, displays, and networks. Such embodiments provide useful physical machines and particularly configured computer hardware arrangements.

Although the embodiments have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the scope. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification.

As one of ordinary skill in the art will readily appreciate from the disclosure, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed, that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.

As can be understood, the examples described above and illustrated are intended to be exemplary only. 

What is claimed is:
 1. A computer implemented system for communicating data messages between a verifier computing device and a portable client computing device, the data messages establishing authentication of at least one client location characteristic of the portable client computing device, the system comprising: the portable client computing device including at least a client computing device processor and data storage, the data storage storing one or more token data objects received from or computed jointly in a multiparty protocol with an issuer computing device, the one or more token data objects generated using at least an issuer computing device private issuance key, the one or more token data objects each including one or more signed data elements representing at least one of the at least one client location characteristic of the portable client computing device; and the client computing device processor configured to: receive a verification request data message from the verifier computing device, the verification request data message comprising a request for confirmation that the portable client device is associated with a particular geographic location; and using a combination of the one or more token data objects and the verification request data message, generate one or more proof data messages without sending any data messages or requests to the issuer computing device.
 2. The computer implemented system as claimed in claim 1, wherein to determine if the portable client device is associated with the particular geographic location, the client computer device processor is configured to: determine if at least one client location characteristic represents a geographic location that is within at least one of: a radius of the particular geographic location; a polygon shape defining an area representing the particular geographic location; or a union of convex polygon shapes defining an area representing the particular geographic location.
 3. The computer implemented system as claimed in claim 1, wherein to determine if the portable client device is associated with the particular geographic location, the client computer device processor is configured to: convert a geographic point associated with the portable client device into a planar approximation; determine a commitment value of a geometric function of the planar approximation; and determine and generate a proof that a result of the geometric function applied to the planar approximation is within a parameter.
 4. The computer implemented system as claimed in claim 3, wherein the client computer processor is further configured to: generate a proof that a commitment is well-formed; send the commitment values and proofs to a verifier device for verification of the location; and receive confirmation from the verification device that the location has been verified.
 5. The computer implemented system as claimed in claim 1, wherein the particular geographic location is a circle having an origin point with a radius defining an area, and wherein to determine if the portable client device is associated with the particular geographic location, the client computer device processor is configured to: convert a geographic point associated with the origin into a planar approximation; determine a commitment value of a distance squared between the planar approximation of the geometric location of portable client device and the planar approximation of the origin; and generating a proof that the distance squared is less than the radius squared.
 6. The computer implemented system as claimed in claim 1, wherein the particular geographic location is a polygon shape having vertices defining an area, and wherein to determine if the portable client device is associated with the particular geographic location, the client computer device processor is configured to: for each endpoint of a vertex of the polygon, convert a geographic point associated with that endpoint into a planar approximation; for each triangle defined by A_(i)PA_(i+1), determine a commitment value of a signed area of that triangle, where A_(i) and A_(i+1) are the planar approximations of endpoints of a vertex of the polygon shape, P is the planar approximation of the particular geographic location associated with the portable client device, and i is an index value representing a vertex of the polygon; and generate a proof that the signed area of each triangle defined by A_(i)PA_(i+1) is a positive value.
 7. The computer implemented system as claimed in claim 1, wherein the particular geographic location is a union of shapes defining an area, and wherein to determine if the portable client device is associated with the particular geographic location, the client computer device processor is configured to: convert the particular geographic location into planar approximations; generate an honest proof for at least one shape that contains the particular geographic location; and generate a simulated proof for all other shapes in the union of shapes.
 8. The computer implemented system of claim 7, wherein to generate a simulated proof of a shape comprising an origin point and a radius defining an area, the client computer device processor is configured to: generate commitments to planar approximations dx and dy of the particular geographic location; generate a first simulated proof portion that dx=r cos φ₀dθ and dy=rdφ; generate commitments to squared planar approximations dx² and dy² of the particular geographic location; generate a second simulated proof portion that dx² and dy² were correctly computed; generate a commitment to δ=r² dx²−dy²; and generate a third simulated proof that a decomposition of δ is a positive value.
 9. The computer implemented system of claim 7, wherein to generate a simulated proof of a polygon shape having vertices defining an area, the client computer device processor is configured to: generate commitments to planar approximations dx and dy of the particular geographic location; generate a first simulated proof portion that dx=r cos φ₀dθ and dy=rdφ; generate commitments to signed values S(A_(i)PA_(i+1)); generate a second simulated proof portion that the signed values were formed correctly; and generate simulated proof portions that all the signed values S(A_(i)PA_(i+1)) are positive values.
 10. The computer implemented system of claim 1, wherein the one or more token data objects are pre-loaded into the data storage such that the generation of the proof can be conducted at a time temporally separated from when the one or more token data objects were generated or preloaded.
 11. The computer implemented system of claim 1, wherein the one or more proof data messages are generated such that the one or more proof data messages can be validated using an issuer computing device public issuance key corresponding to the issuer computing device private issuance key.
 12. A computer implemented method for communicating data messages between a verifier computing device and a portable client computing device, the data messages establishing authentication of at least one client location characteristic of the portable client computing device, the method comprising: storing one or more token data objects received from an issuer computing device, the one or more token data objects generated using at least an issuer computing device private issuance key, the one or more token data objects each including one or more signed data elements representing at least one of the at least one client location characteristic of the portable client computing device; receiving a verification request data message from the verifier computing device, the verification request data message comprising a request for confirmation that the portable client device is associated with a particular geographic location; and using a combination of the one or more token data objects and the verification request data message, generate one or more proof data messages without sending any data messages or requests to the issuer computing device.
 13. The computer implemented method as claimed in claim 12, wherein determining if the portable client device is associated with the particular geographic location comprises: determining if at least one client location characteristic represents a geographic location that is within at least one of: a radius of the particular geographic location; a polygon shape defining an area representing the particular geographic location; or a union of convex polygon shapes defining an area representing the particular geographic location.
 14. The computer implemented method as claimed in claim 12, wherein determining if the portable client device is associated with the particular geographic location comprises: converting a geographic point associated with the portable client device into a planar approximation; determining a commitment value of a geometric function of the planar approximation; and determining a result of the geometric function applied to the planar approximation is within a parameter.
 15. The computer implemented method as claimed in claim 12, wherein the particular geographic location is a circle having an origin point with a radius defining an area, and wherein to determine if the portable client device is associated with the particular geographic location comprises: converting a geographic point associated with the origin into a planar approximation; determining a commitment value of a distance between squares of the planar approximation of the geometric location of portable client device and the planar approximation of the origin; and confirming that the distance is less than the radius.
 16. The computer implemented method as claimed in claim 12, wherein the particular geographic location is a polygon shape having vertices defining an area, and wherein determining if the portable client device is associated with the particular geographic location comprises: for each endpoint of a vertex of the polygon, converting a geographic point associated with that endpoint into a planar approximation; for each triangle defined by A_(i)PA_(i+1), determining a commitment value of a signed area of that triangle, where A_(i) and A_(i+1) are the planar approximations of endpoints of a vertex of the polygon shape, P is the planar approximation of the particular geographic location associated with the portable client device, and i is an index value representing a vertex of the polygon; and confirming that the signed area of each triangle defined by A_(i)PA_(i+1) is a positive value.
 17. The computer implemented method as claimed in claim 12, wherein the particular geographic location is a union of convex polygon shapes defining an area, and wherein determining if the portable client device is associated with the particular geographic location comprises: converting the particular geographic location into planar approximations; generating an honest proof for at least one shape that contains the particular geographic location; and generating a simulated proof for all other shapes in the union of shapes.
 18. The computer implemented method of claim 17, wherein generating a simulated proof of a shape comprising an origin point and a radius defining an area comprises: generating commitments to planar approximations dx and dy of the particular geographic location; generating a first simulated proof portion that dx=r cos φ₀dθ and dy=rdφ; generating commitments to squared planar approximations dx² and dy² of the particular geographic location; generating a second simulated proof portion that dx² and dy² were correctly computed; generating a commitment to δ=r²−dx²−dy²; and generating a third simulated proof that a decomposition of δ is a positive value.
 19. The computer implemented system of claim 17, wherein generating a simulated proof of a polygon shape having vertices defining an area comprises: generating commitments to planar approximations dx and dy of the particular geographic location; generating a first simulated proof portion that dx=r cos φ₀dθ and dy=rdφ; generating commitments to signed values S(A_(i)PA_(i+1)); generating a second simulated proof portion that the signed values were formed correctly; and generating simulated proof portions that all the signed values S(A_(i)PA_(i+1)) are positive values.
 20. The computer implemented method of claim 12, wherein the one or more token data objects are pre-loaded into the data storage such that the generation of the proof can be conducted at a time temporally separated from when the one or more token data objects were generated or preloaded.
 21. The computer implemented method of claim 12, wherein the one or more proof data messages are generated such that the one or more proof data messages can be validated using an issuer computing device public issuance key corresponding to the issuer computing device private issuance key. 